perm filename F78.IN[LET,JMC]2 blob
sn#407315 filedate 1978-12-31 generic text, type C, neo UTF8
COMMENT ⊗ VALID 00302 PAGES
C REC PAGE DESCRIPTION
C00001 00001
C00028 00002
C00029 00003 ∂11-Oct-78 1359 HVA JMC - per your request, I callled Marilyn Kloes, and she
C00030 00004 ∂11-Oct-78 2009 SSO Modal logic seminar
C00031 00005 ∂12-Oct-78 0948 PAT
C00032 00006 ∂12-Oct-78 1003 PAM
C00038 00007 ∂12-Oct-78 2205 LGC via AMES-TIP Don't read it all ...
C00039 00008 ∂12-Oct-78 2323 LLW
C00048 00009 ∂13-Oct-78 0956 Lenat at SUMEX-AIM party
C00050 00010 ∂13-Oct-78 1203 REM via AMES-TIP Brochure describing my method functionally (not internally)
C00051 00011 ∂13-Oct-78 2130 DCO
C00053 00012 ∂14-Oct-78 1820 LGC via AMES-TIP Wait for the new version don't bother with the old one --
C00054 00013 ∂15-Oct-78 1200 JB
C00057 00014 ∂16-Oct-78 0850 BPM FLASH: Herb Simon wins Nobel Prize
C00063 00015 ∂16-Oct-78 1047 JB
C00064 00016 ∂17-Oct-78 1049 CET
C00066 00017 ∂17-Oct-78 1738 ARK S-1 Meeting Notice
C00067 00018 ∂17-Oct-78 2322 TOB mech eng
C00068 00019 ∂17-Oct-78 2348 TOB Leifer account
C00069 00020 ∂18-Oct-78 0005 TOB Leifer
C00070 00021 ∂18-Oct-78 0211 MRC DLNSTA
C00072 00022 ∂18-Oct-78 0807 DEK TEX manual corrections
C00073 00023 ∂19-Oct-78 0024 BLH Corrections to "LISP: Programming and Proving"
C00075 00024 ∂19-Oct-78 1129 CET
C00076 00025 ∂19-Oct-78 1901 100 : rwg
C00077 00026 ∂20-Oct-78 0222 ALL Macro Processor for PASCAL
C00078 00027 ∂20-Oct-78 1332 JBR
C00082 00028 ∂22-Oct-78 0618 PLS Concept paper
C00083 00029 ∂22-Oct-78 2052 LCW
C00084 00030 ∂23-Oct-78 0117 NS
C00085 00031 ∂23-Oct-78 0249 DCL
C00087 00032 ∂23-Oct-78 1028 DWW Modal Logic Seminar
C00088 00033 ∂23-Oct-78 1325 SJF Parikh's talk at Luckham's seminar
C00089 00034 ∂23-Oct-78 1332 SJF correction
C00090 00035 ∂23-Oct-78 1445 ME NS errors
C00091 00036 ∂23-Oct-78 1638 Bmoore at SRI-KL (Bob Moore) References to my MS thesis
C00093 00037 ∂24-Oct-78 0304 MRC new Dialnet service
C00095 00038 ∂24-Oct-78 0946 Mcgoveran at SUMEX-AIM DEC System Proposal
C00097 00039 ∂24-Oct-78 1218 TED
C00098 00040 ∂24-Oct-78 1355 Mcgoveran at SUMEX-AIM DEC System Proposal meeting
C00099 00041 ∂24-Oct-78 1404 Hart at SRI-KL (Peter Hart)
C00100 00042 ∂24-Oct-78 1416 REF
C00101 00043 ∂24-Oct-78 1422 Rindfleisch at SUMEX-AIM CONDOLENCES
C00102 00044 ∂24-Oct-78 1502 REP CS-206
C00103 00045 ∂24-Oct-78 1451 HVA TELEPHONE CALL FROM SAN JOSE MERCURY
C00105 00046 ∂24-Oct-78 1505 HVA CS 206
C00106 00047 ∂24-Oct-78 1710 ALL Pascal Macros
C00107 00048 ∂24-Oct-78 2018 DCO
C00111 00049 ∂24-Oct-78 2125 JP InterLISP manual
C00112 00050 ∂24-Oct-78 2131 DCL
C00115 00051 ∂25-Oct-78 0848 Feigenbaum at SUMEX-AIM Tried to get you last night
C00116 00052 ∂25-Oct-78 1027 CLT
C00117 00053 ∂25-Oct-78 1038 PAT
C00118 00054 ∂25-Oct-78 1047 CH
C00119 00055 ∂25-Oct-78 1110 RWW
C00120 00056 ∂25-Oct-78 1206 TW vera
C00121 00057 ∂25-Oct-78 1947 Jrobinson at SRI-KL (Jane Robinson) dinner thursday
C00122 00058 ∂25-Oct-78 2341 ZM
C00123 00059 ∂26-Oct-78 0109 WD
C00124 00060 ∂26-Oct-78 0122 MRC Dialnet performance statistics
C00125 00061 ∂26-Oct-78 0751 PRATT at MIT-AI (Vaughan Pratt)
C00127 00062 ∂26-Oct-78 0754 Feigenbaum at SUMEX-AIM Stanford News Service: Bob Byers
C00128 00063 ∂26-Oct-78 0800 Buchanan at SUMEX-AIM
C00129 00064 ∂26-Oct-78 0820 CH
C00130 00065 ∂26-Oct-78 0847 CH
C00131 00066 ∂26-Oct-78 0944 Feinler at SRI-KL (Jake Feinler) Very sad news
C00133 00067 ∂26-Oct-78 1010 CH
C00134 00068 ∂26-Oct-78 1030 Levinthal at SUMEX-AIM condolences
C00135 00069 ∂26-Oct-78 1033 PAT whit diffie
C00136 00070 ∂26-Oct-78 1054 Bmoore at SRI-KL (Bob Moore)
C00138 00071 ∂26-Oct-78 1325 LCW Net Proposals
C00140 00072 ∂26-Oct-78 1448 Mcgoveran at SUMEX-AIM Faculty Meeting
C00142 00073 ∂26-Oct-78 1534 MINSKY at MIT-AI (Marvin Minsky) Couldn't reach you by phone.
C00143 00074 ∂28-Oct-78 1522 Feldman at SUMEX-AIM Condolences
C00144 00075 ∂28-Oct-78 1532 KNUTH at MIT-MC (Donald E. Knuth)
C00145 00076 ∂28-Oct-78 1533 Wiederhold at SUMEX-AIM S-1 Meeting
C00146 00077 ∂28-Oct-78 1555 Wiederhold at SUMEX-AIM S-1 Meeting
C00147 00078 ∂29-Oct-78 1633 PAT vacation plans
C00148 00079 ∂30-Oct-78 0912 AFB
C00150 00080 ∂31-Oct-78 1250 BTH Modal Logic Seminar
C00152 00081 ∂01-Nov-78 0826 ACH via UTAH-TIP BOLLMANN
C00154 00082 ∂01-Nov-78 1309 BTH Modal Logic Seminar
C00155 00083 ∂01-Nov-78 1407 Mcgoveran at SUMEX-AIM Rabin dinner
C00156 00084 ∂01-Nov-78 1529 Nilsson at SRI-KL (Nils Nilsson) Getting together
C00158 00085 ∂01-Nov-78 1536 CLT
C00162 00086 ∂01-Nov-78 1918 LGC Work on Knowledge Representation at SAIL
C00166 00087 ∂01-Nov-78 1932 LGC TI Terminal
C00167 00088 ∂01-Nov-78 2359 Jrobinson at SRI-KL (Jane Robinson) hello
C00168 00089 ∂02-Nov-78 1312 CH
C00169 00090 ∂02-Nov-78 1313 CH
C00170 00091 ∂02-Nov-78 1324 Nilsson at SRI-KL (Nils Nilsson) ( Forwarded Mail )
C00171 00092 ∂02-Nov-78 1552 LES Megastore memory
C00172 00093 ∂02-Nov-78 2109 SMG Hoover Institution
C00178 00094 ∂03-Nov-78 0901 FB via SU-TIP new terminals
C00179 00095 ∂03-Nov-78 1131 Nilsson at SRI-KL (Nils Nilsson) Change of time
C00180 00096 ∂03-Nov-78 1923 Winograd at SUMEX-AIM Meeting on non-monotonic logic
C00182 00097 ∂03-Nov-78 1923 Nilsson at SRI-KL (Nils Nilsson) Meeting
C00183 00098 ∂03-Nov-78 1924 Jrobinson at SRI-KL (Jane Robinson) Sunday brunch
C00186 00099 ∂04-Nov-78 1737 LPL via SU-TIP labels
C00187 00100 ∂04-Nov-78 1738 Wiederhold at SUMEX-AIM Progress report
C00195 00101 ∂04-Nov-78 2049 BTH SMA3
C00196 00102 ∂04-Nov-78 2054 DCL
C00199 00103 ∂05-Nov-78 1413 RAJ.REDDY(A610RR29) at CMU-10B
C00200 00104 ∂06-Nov-78 1042 CLT
C00201 00105 ∂06-Nov-78 1037 HVA Letters
C00202 00106 ∂06-Nov-78 1327 RWW
C00203 00107 ∂06-Nov-78 1401 RWW
C00204 00108 ∂06-Nov-78 1409 Ijcai79 at SUMEX-AIM IJCAI-79
C00206 00109 ∂06-Nov-78 1415 JMC
C00208 00110 ∂06-Nov-78 2223 JB ORALS.
C00210 00111 ∂07-Nov-78 1051 CH
C00211 00112 ∂07-Nov-78 1051 CET Textbook for Winter Quarter CS258
C00212 00113 ∂07-Nov-78 1120 PHW at MIT-AI (Patrick H. Winston)
C00214 00114 ∂07-Nov-78 1207 Feigenbaum at SUMEX-AIM Personal/confidential
C00215 00115 ∂07-Nov-78 1450 CH chinese delegation visiting Stanford
C00217 00116 ∂07-Nov-78 1643 RIVEST at MIT-ML (Ronald L. Rivest)
C00219 00117 ∂07-Nov-78 1652 JB TAK FUNCTION.
C00220 00118 ∂08-Nov-78 1359 Nilsson at SRI-KL ( Lunch?
C00233 00119 ∂08-Nov-78 1448 CCH
C00234 00120 ∂08-Nov-78 2325 SSO Modal Logic Seminar
C00235 00121 ∂09-Nov-78 0246 MRC Dialnet performance
C00236 00122 ∂09-Nov-78 0849 JLH LOTS
C00237 00123 ∂09-Nov-78 1105 Scott at PARC-MAXC Reminder
C00238 00124 ∂09-Nov-78 1110 CH
C00239 00125 ∂09-Nov-78 1116 Nilsson at SRI-KL (Nils Nilsson) Lunch at 12:30 ok
C00240 00126 ∂09-Nov-78 1414 DRB via MIT-MC patte
C00241 00127 ∂09-Nov-78 1513 Ijcai79 at SUMEX-AIM MEETING AT 3:00
C00242 00128 ∂09-Nov-78 1615 Jrobinson at SRI-KL (Jane Robinson) Memorial service
C00244 00129 ∂09-Nov-78 1642 Jrobinson at SRI-KL (Jane Robinson) I forgot
C00246 00130 ∂09-Nov-78 2132 JMC Ruth Kirk called
C00247 00131 ∂10-Nov-78 0704 FB keyboards
C00248 00132 ∂10-Nov-78 0743 REM via AMES-TIP IC2 results!
C00250 00133 ∂10-Nov-78 1002 Jrobinson at SRI-KL (Jane Robinson) Program
C00251 00134 ∂10-Nov-78 1040 HVA Stanford DAILY - Fri. ll/10/78
C00252 00135 ∂10-Nov-78 1112 HVA CORKY C'S Thesis - AIM 296
C00253 00136 ∂10-Nov-78 1257 JB Orals data.
C00254 00137 ∂10-Nov-78 1327 ARK S-1 Meeting
C00255 00138 ∂10-Nov-78 1352 TOB POLISH VISITORS
C00256 00139 ∂10-Nov-78 1357 JB TAKFU.PRO[GOL,JB].
C00257 00140 ∂10-Nov-78 1415 HVA AIRLINE TICKETS
C00258 00141 ∂10-Nov-78 1538 Jrobinson at SRI-KL (Jane Robinson) Saturday brunch
C00259 00142 ∂10-Nov-78 2025 BTH
C00260 00143 ∂11-Nov-78 1710 JBR
C00261 00144 ∂11-Nov-78 1715 MRC
C00262 00145 ∂11-Nov-78 2241 DCO
C00263 00146 ∂12-Nov-78 1900 LLW Vera
C00265 00147 ∂12-Nov-78 2113 MRC Dialnet performance
C00266 00148 ∂12-Nov-78 2117 WD
C00267 00149 ∂12-Nov-78 2140 ALS
C00273 00150 ∂12-Nov-78 2347 ZM Richard Lee - lunch
C00274 00151 ∂13-Nov-78 0720 REM via SU-TIP MORE IC2 RESULS
C00275 00152 ∂13-Nov-78 1147 REM at SU-AI at MIT-AI
C00277 00153 ∂13-Nov-78 1631 BTH
C00278 00154 ∂14-Nov-78 0847 Tajnai at SUMEX-AIM MTC Qual
C00279 00155 ∂14-Nov-78 0928 JLH via SU-TIP Pascal types and the S1
C00281 00156 ∂14-Nov-78 1058 DPB Colloquium scheduling as of Nov 14, 78
C00282 00157 ∂14-Nov-78 1653 MRC
C00283 00158 ∂14-Nov-78 1658 CLT
C00286 00159 ∂14-Nov-78 1717 MRC
C00287 00160 ∂14-Nov-78 1952 MRC
C00290 00161 ∂14-Nov-78 2343 WD
C00291 00162 ∂15-Nov-78 0345 MRC Biz Skool
C00292 00163 ∂15-Nov-78 1108 CH
C00293 00164 ∂15-Nov-78 1356 DCL user load
C00295 00165 ∂15-Nov-78 1653 DEW
C00296 00166 ∂15-Nov-78 1948 REF phone message from Sarah
C00297 00167 ∂16-Nov-78 0904 Wiederhold at SUMEX-AIM A map in symbolic notation
C00300 00168 ∂16-Nov-78 1014 PAT message from Egon regarding Ershov
C00301 00169 ∂16-Nov-78 1326 TOB
C00303 00170 ∂16-Nov-78 2041 MRC Re: LIV and autologout
C00305 00171 ∂17-Nov-78 0720 REM via AMES-TIP Latest data-compression research results
C00308 00172 ∂17-Nov-78 0922 HVA Concert Ticket
C00309 00173 ∂17-Nov-78 1035 REM via AMES-TIP Analysis of latest data-compression research data
C00312 00174 ∂17-Nov-78 1100 JMC*
C00313 00175 ∂17-Nov-78 1121 TOB AL
C00314 00176 ∂17-Nov-78 1214 HVA Various Plans
C00315 00177 ∂17-Nov-78 1428 Jrobinson at SRI-KL (Jane Robinson)
C00319 00178 ∂17-Nov-78 1614 Jrobinson at SRI-KL (Jane Robinson) dinner and party
C00320 00179 ∂17-Nov-78 1727 TOB computer
C00322 00180 ∂17-Nov-78 1746 TOB
C00327 00181 ∂18-Nov-78 0859 Jrobinson at SRI-KL (Jane Robinson) 7 it is
C00328 00182 ∂18-Nov-78 1625 DCL What the new CS/EE 20-60 will do for the AI lab overload
C00330 00183 ∂18-Nov-78 1638 DCL
C00332 00184 ∂18-Nov-78 1850 REM via SU-TIP Significant-context surveys
C00333 00185 ∂19-Nov-78 0738 DCO
C00338 00186 ∂19-Nov-78 1046 LCW SMA3
C00339 00187 ∂19-Nov-78 1642 JC Thanks
C00340 00188 ∂20-Nov-78 1252 JMC Ershov visit
C00342 00189 ∂20-Nov-78 1316 Feigenbaum at SUMEX-AIM ershov visit
C00343 00190 ∂20-Nov-78 1414 LES S1
C00344 00191 ∂20-Nov-78 1518 REF
C00346 00192 ∂20-Nov-78 1751 REM via AMES-TIP First test of IC2 on 80-column-formatted text
C00348 00193 ∂21-Nov-78 0841 DEK Ershov visit
C00349 00194 ∂21-Nov-78 1219 HVA Party for Ted
C00350 00195 ∂21-Nov-78 1407 Mcgoveran at SUMEX-AIM Weizenbaum
C00352 00196 ∂21-Nov-78 1420 Feigenbaum at SUMEX-AIM ershov visit
C00353 00197 ∂21-Nov-78 1430 HVA Tapes
C00354 00198 ∂21-Nov-78 1714 BH
C00356 00199 ∂21-Nov-78 1722 BH
C00359 00200 ∂21-Nov-78 1816 BH purge
C00360 00201 ∂21-Nov-78 1816 BH purge
C00361 00202 ∂22-Nov-78 1024 TW
C00363 00203 ∂22-Nov-78 1045 HVA Reception Bills
C00364 00204 ∂22-Nov-78 1100 ARK*
C00365 00205 ∂22-Nov-78 1950 CLT
C00366 00206 ∂22-Nov-78 2033 DEK developments
C00370 00207 ∂23-Nov-78 0112 MRC Bad news
C00372 00208 ∂23-Nov-78 0834 FB S1 proposal
C00373 00209 ∂23-Nov-78 1157 REP CS-206
C00374 00210 ∂24-Nov-78 0402 LLW
C00375 00211 ∂24-Nov-78 1328 FB meetings
C00376 00212 ∂26-Nov-78 0316 REM via AMES-TIP More results on IC2, including pseudo-IBM360 file
C00379 00213 ∂26-Nov-78 0430 REM via AMES-TIP More results on pseudo-IBM files, FORTRASH this time.
C00381 00214 ∂26-Nov-78 1412 LCW Open House
C00382 00215 ∂26-Nov-78 1649 DCL
C00385 00216 ∂26-Nov-78 2020 WP :"Fixed points of LISP functions"
C00387 00217 ∂26-Nov-78 2159 MINSKY at MIT-AI (Marvin Minsky)
C00388 00218 ∂27-Nov-78 0900 ARK* Reminder-S1 Meeting
C00389 00219 ∂27-Nov-78 1334 CLT
C00391 00220 ∂28-Nov-78 1421 PAT phone calls
C00392 00221 ∂28-Nov-78 2323 BIL s1 manual error
C00393 00222 ∂29-Nov-78 1345 Greep at Rand-Unix Proposal for CS206 project
C00396 00223 ∂29-Nov-78 1436 SJF modal logic seminar
C00397 00224 ∂29-Nov-78 1456 Jrobinson at SRI-KL (Jane Robinson)
C00399 00225 ∂30-Nov-78 0444 REM
C00401 00226 ∂30-Nov-78 1119 DEK
C00402 00227 ∂01-Dec-78 1446 SSO Party
C00403 00228 ∂03-Dec-78 1134 MRC DIALNET
C00405 00229 ∂03-Dec-78 1414 SSO via SU-TIP Party
C00406 00230 ∂04-Dec-78 1212 HQM at MIT-AI (Henry Minsky)
C00408 00231 ∂04-Dec-78 1654 DCL
C00411 00232 ∂04-Dec-78 1816 SJF bimodal logic
C00412 00233 ∂04-Dec-78 2100 DPB TA for 258?
C00413 00234 ∂05-Dec-78 1003 REP CS-206 Final
C00414 00235 ∂05-Dec-78 1026 MAILER failed mail returned
C00415 00236 ∂05-Dec-78 1223 DPB Russian mathematician visiting
C00416 00237 ∂05-Dec-78 1626 LES S1 proposal
C00419 00238 ∂06-Dec-78 1515 SSO via SU-TIP Seminar at SRI -- you may be interested
C00420 00239 ∂06-Dec-78 1522 SSO via SU-TIP
C00423 00240 ∂07-Dec-78 1300 JMC*
C00425 00241 ∂08-Dec-78 0255 JBR
C00428 00242 ∂08-Dec-78 0944 PN upcoming purge
C00430 00243 ∂08-Dec-78 1027 PN
C00431 00244 ∂08-Dec-78 1607 ARK S-1 Meeting Notice
C00432 00245 ∂08-Dec-78 1615 ARK via SU-TIP Mailing Lists
C00434 00246 ∂08-Dec-78 1646 LES Ampex megastore
C00435 00247 ∂09-Dec-78 0314 MRC Tops-20 Dialnet programming notes
C00438 00248 ∂09-Dec-78 1520 REF
C00439 00249 ∂09-Dec-78 1522 REF CS. 206
C00440 00250 ∂09-Dec-78 1658 LES S1 proposal
C00441 00251 ∂10-Dec-78 0047 Eric Ostrom at CMU-10A (S300EO10) dialnet
C00442 00252 ∂10-Dec-78 0145 MRC Dialnet documents
C00443 00253 ∂10-Dec-78 0156 LLW
C00446 00254 ∂10-Dec-78 0427 LLW Jeff's Resignation
C00450 00255 ∂10-Dec-78 1247 LES Dialnet documents
C00451 00256 ∂10-Dec-78 1429 MRC via SU-TIP Dialnet inquiry
C00453 00257 ∂10-Dec-78 1556 HPM CC of message to LLW
C00455 00258 ∂10-Dec-78 2001 MRC FSIM jobs
C00456 00259 ∂11-Dec-78 1159 Jrobinson at SRI-KL (Jane Robinson)
C00458 00260 do m[let,jmc]418 Mcgoveran at SUMEX-AIM Faculty Meeting
C00459 00261 ∂11-Dec-78 1724 RPG NEWIO programming tips
C00461 00262 ∂12-Dec-78 0841 ALS
C00462 00263 ∂12-Dec-78 0957 PAT
C00463 00264 ∂12-Dec-78 1100 JMC*
C00464 00265 ∂12-Dec-78 1715 BH
C00465 00266 ∂12-Dec-78 1722 BH
C00468 00267 ∂13-Dec-78 1014 Mcgoveran at SUMEX-AIM Faculty meeting
C00469 00268 ∂13-Dec-78 1315 PAT tapes
C00470 00269 ∂13-Dec-78 1625 Mcgoveran at SUMEX-AIM Lieberman meeting,12/21
C00471 00270 ∂13-Dec-78 1935 FB via SU-TIP S-1 proprosal
C00472 00271 ∂14-Dec-78 0852 Mcgoveran at SUMEX-AIM Faculty meeting
C00473 00272 ∂14-Dec-78 1210 PAT logic search meeting
C00474 00273 ∂15-Dec-78 0203 TOB support
C00475 00274 ∂15-Dec-78 1438 RDR* via AMET
C00476 00275 ∂15-Dec-78 1642 ME remind queue rollback
C00477 00276 ∂15-Dec-78 1601 LES Kim support
C00478 00277 ∂15-Dec-78 1720 RDR* via AMET
C00479 00278 ∂15-Dec-78 2314 REP FINAL
C00480 00279 ∂16-Dec-78 0020 ZM good-bye
C00481 00280 ∂16-Dec-78 1217 REP Appearence
C00482 00281 ∂17-Dec-78 0208 REM via AMES-TIP
C00483 00282 ∂17-Dec-78 0232 MRC Dialnet → host table
C00484 00283 ∂18-Dec-78 1240 REP Meetng today
C00485 00284 ∂19-Dec-78 1307 HVA This and That
C00486 00285 ∂20-Dec-78 0823 Mcgoveran at SUMEX-AIM Stanford Clubs' Speakers Bureau
C00488 00286 ∂20-Dec-78 2038 MRC VADIC cable
C00489 00287 ∂20-Dec-78 2228 MRC Tops-20 front end sources
C00491 00288 ∂21-Dec-78 0032 JB Letter of recommendation.
C00492 00289 ∂21-Dec-78 1112 HVA Thank You....
C00493 00290 ∂21-Dec-78 1219 RPG Bug fix in NEWIO
C00494 00291 ∂22-Dec-78 0848 FB Displays
C00495 00292 ∂22-Dec-78 1149 JB
C00497 00293 ∂22-Dec-78 1630 RPG DEFUN change.
C00498 00294 ∂23-Dec-78 1605 FB Terminals
C00499 00295 ∂23-Dec-78 1947 REM at MIT-MC (Robert Elton Maas)
C00501 00296 ∂24-Dec-78 1217 JB
C00502 00297 ∂24-Dec-78 1256 GLS at MIT-AI (Guy L. Steele, Jr.) Allocating arrays and hunks
C00504 00298 ∂25-Dec-78 1006 RWG
C00505 00299 ∂26-Dec-78 0125 REM
C00506 00300 ∂26-Dec-78 0715 JONL at MIT-MC (Jon L White) LIMIT-CONS for arrays and hunks
C00508 00301 ∂26-Dec-78 1000 JMC*
C00509 00302 ∂26-Dec-78 1034 BH downtime
C00510 ENDMK
C⊗;
∂11-Oct-78 1359 HVA JMC - per your request, I callled Marilyn Kloes, and she
CC: JMC, LES, TED, HVA
will try to expedite the DAA for Lab and GSB.
∂11-Oct-78 2009 SSO Modal logic seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
Thursday, Oct. 12 Leslie Lamport
"Safety and Liveness Proofs for Parallel Programs"
ERL 237 2:45-4:00
P.s. If you would like to be removed from this mailing list, just let me know.
∂12-Oct-78 0948 PAT
Thank you for the dinner and movie, it was very enjoyable and very nice of you - patte
∂12-Oct-78 1003 PAM
John .... I was puzzled by this news story, as I had heard nothing about
Seasat having any underwater detection equipment, much less being able to
"see" a mile deep. I was under the impression that such an ability would
make submarines obsolete as secure missle platforms, a very significant
change in the status of the worldwide nuclear standoff. Is this just a
reporter's gaff, or is there more going on here??? Paul
a032 0136 12 Oct 78
PM-Killer Satellite,470
COCOA, Fla. (AP) - Scientists at the Jet Propulsion Laboratory in
California deny a published report here that space agency officials
believe a ''killer satellite'' may have knocked out power in an ocean
research satellite as it flew over the Soviet Union.
In today's edition, the newspaper TODAY said the ''killer
satellite'' theory was one of several discussed by scientists trying
to learn why they lost radio contact with the Seasat-A satellite
Monday.
The newspaper quoted Walter McCandless, the National Aeronautics and
Space Administration's manager for the Seasat program, as saying
''we've had a thought or two about'' the possibility of an aggressor
satellite rendering the U.S. craft useless.
But in Pasadena, Calif., Gene Giberson, the Seasat project manager,
said a killer satellite never came up in discussions on the project.
He said it's most likely that a short circuit caused the power loss.
''Those of us directly involved trying to understand what happened
have focused on data we have viewed,'' Giberson said. ''We have not
discussed the theory (killer satellite) on the project.
''The evidence just supports the very straightforward idea of a
short circuit in the on-board power system,'' he said. ''No one
directly associated with conduct of project has considered the
theory.''
The newspaper also quoted McCandless as saying that ''the massive
damage we have sustained to the spacecraft leaves us in a position
that we don't know whether we caused it internally or if it was caused
by an external force.''
According to TODAY, McCandless mentioned two possibilities for the
failure: a short circuit or another satellite. Another source was
quoted as saying a powerful laser beam directed at the craft from
Earth could have crippled it.
**************************************************************************
* The Soviet Union has been upset over Seasat's operation for some *
* time, unidentified NASA sources told the newspaper, possibly because *
* the satellite has the capability of ''seeing'' nearly a mile beneath *
* the ocean's surface. *
**************************************************************************
The newspaper also said its sources said U.S. Navy officials had
been editing data received from the satellite before turning the
information over to NASA scientists.
In Washington, however, Pentagon and State Department spokesmen said
they had no information about the killer satellite theory.
Meanwhile, Robert Newman, NASA's public affairs director, reached in
Washington, said ''there's no reason'' for an attack on the
satellite.
''There'd be no purpose in that,'' he said, because it was a
commercial satellite used to study ocean currents.
Newman characterized conjecture about a killer satellite as ''total
speculation.''
The satellite was launched about three months ago from Vandenberg
Air Force Base in California and had functioned with no trouble until
it failed Monday.
ap-ny-10-12 0439EDT
- - - - - -
I have no idea how Seasat might see a mile deep, but I have read that
there are worries about the reliability of the submarine deterrent based
on some (potential) method of locating and destroying submarines.
∂12-Oct-78 2205 LGC via AMES-TIP Don't read it all ...
When I gave you those pages to read this afternoon, I didn't realize how
how rough it gets towards the end. Much needed explanatory material is
missing, and there are some errors. In particular, I am happy to find
that definitions D1 and D3 do NOT define modal predicates (I think I
confused the sense of a name with Concept1 of the thing named). Thus, all
four definitions yield extensional predicates. For the present, it would
probably be best not to read past D4; I'll give you a much improved
version of the rest tomorrow.
∂12-Oct-78 2323 LLW
To: PAM
CC: LLW, JMC
∂12-Oct-78 1509 PAM
Lowell....
I am a student at the AI Lab; I sent JMC the query below and he suggested
that I ask you. Can you shed some light on this??
I was puzzled by this news story, as I had heard nothing about
Seasat having any underwater detection equipment, much less being able to
"see" a mile deep. I was under the impression that such an ability would
make submarines obsolete as secure missle platforms, a very significant
change in the status of the worldwide nuclear standoff. Is this just a
reporter's gaff, or is there more going on here??? Paul Martin
a032 0136 12 Oct 78
PM-Killer Satellite,470
COCOA, Fla. (AP) - Scientists at the Jet Propulsion Laboratory in
California deny a published report here that space agency officials
believe a ''killer satellite'' may have knocked out power in an ocean
research satellite as it flew over the Soviet Union.
In today's edition, the newspaper TODAY said the ''killer
satellite'' theory was one of several discussed by scientists trying
to learn why they lost radio contact with the Seasat-A satellite
Monday.
The newspaper quoted Walter McCandless, the National Aeronautics and
Space Administration's manager for the Seasat program, as saying
''we've had a thought or two about'' the possibility of an aggressor
satellite rendering the U.S. craft useless.
But in Pasadena, Calif., Gene Giberson, the Seasat project manager,
said a killer satellite never came up in discussions on the project.
He said it's most likely that a short circuit caused the power loss.
''Those of us directly involved trying to understand what happened
have focused on data we have viewed,'' Giberson said. ''We have not
discussed the theory (killer satellite) on the project.
''The evidence just supports the very straightforward idea of a
short circuit in the on-board power system,'' he said. ''No one
directly associated with conduct of project has considered the
theory.''
The newspaper also quoted McCandless as saying that ''the massive
damage we have sustained to the spacecraft leaves us in a position
that we don't know whether we caused it internally or if it was caused
by an external force.''
According to TODAY, McCandless mentioned two possibilities for the
failure: a short circuit or another satellite. Another source was
quoted as saying a powerful laser beam directed at the craft from
Earth could have crippled it.
**************************************************************************
* The Soviet Union has been upset over Seasat's operation for some *
* time, unidentified NASA sources told the newspaper, possibly because *
__ the satellite has the capability of ''seeing'' nearly a mile beneath *
* the ocean's surface. *
**************************************************************************
The newspaper also said its sources said U.S. Navy officials had
been editing data received from the satellite before turning the
information over to NASA scientists.
In Washington, however, Pentagon and State Department spokesmen said
they had no information about the killer satellite theory.
Meanwhile, Robert Newman, NASA's public affairs director, reached in
Washington, said ''there's no reason'' for an attack on the
satellite.
''There'd be no purpose in that,'' he said, because it was a
commercial satellite used to study ocean currents.
Newman characterized conjecture about a killer satellite as ''total
speculation.''
The satellite was launched about three months ago from Vandenberg
Air Force Base in California and had functioned with no trouble until
it failed Monday.
ap-ny-10-12 0439EDT
- - - - - -
[Dear Mr. Martin: I cannot comment at all specifically on the use of
SEASAT to look to mile depths in the ocean, mostly because I am nearly
totally ignorant of the technical specifications of the SEASAT sensor
suite, but also because the matter would be extremely sensitive if such
capability existed. I can, however, call your attention to two physical
facts which may be pertinent:
1. The molecular extinction coefficient for ultra-pure water for visible
light at the frequency at which ocean transmission is a maximum is about
0.02/meter, ie you lose 1/e of your incident intensity over a 50 meter
pathlength. Some flavors of deep (e.g., biologically nearly sterile) ocean
water approach this transmission quality. To transmit light from the
surface to a sub at a mile (1600 meter) depth and back again to a sensor
at the ocean surface thus involves an intensity loss of at least exp(-64),
about 19 orders of magnitude. This is impractically large to cope with
in a satellite system of any type, by a really large margin.
2. "Seeing" through a mile of ocean water is NOT necessarily done with light,
or by any other direct, single-stage means. More conceptually complex
techniques are much more feasible, in at least a quantitative sense, and
may even be susceptible to being packaged in a satellite. . . .
Sincerely,
Lowell Wood]
∂13-Oct-78 0956 Lenat at SUMEX-AIM party
Date: 13 Oct 1978 0956-PDT
From: Lenat at SUMEX-AIM
Subject: party
To: jmc at SAIL
*********************************************************
* BAL DE TETES
* --------------------
*
* Merle and Doug Lenat
* invite
* You (and your significant other)
* to
*
* A Halloween Party
*
* Saturday, October 28, 8:30 pm
* please come in costume
*
* 1752 Selig Lane
* Los Altos
*
* 965-1228 RSVP
*
**********************************************************
-------
∂13-Oct-78 1203 REM via AMES-TIP Brochure describing my method functionally (not internally)
To: RWW, JMC
See PAT1.WRU[1,REM] -- can you think or any other applications?
To RWW, Neils Reimers passed my case to George Johnson who passed it
to John Poitras who stopped the buck + studied my writeups + met with
me to discuss the invention. John Poitras will be contacting you
to discuss marketing it if he hasn't already.
∂13-Oct-78 2130 DCO
To: "@GROUP.DIS[VCG,DCL]" at SU-AI
***********************************************************************
VERIFICATION GROUP SEMINAR
TUESDAY 17TH OCTOBER
PLACE: ERL 237
TIME: 2:30 p.m.
TITLE: Simplification
SPEAKER: Dr. Derek Oppen
Abstract
I will describe the simplifier presently in use in the Stanford verifier.
The simplifier operates on a shared data structure (a directed graph)
specifically designed to handle equalities and pattern matching
efficiently. The main control mechanism of the simplifier is a pattern
matching primitive. It is used to invoke decision procedures (for such
theories as the quantifier-free theory of arrays or list structures) and
also lemmas and rules provided by the user. The pattern matcher consists
conceptually of a number of parallel processes, dynamically allocated,
each of which tries to match a pattern against a candidate node in the
common data structure of the simplifier.
*****************************************************************************
∂14-Oct-78 1820 LGC via AMES-TIP Wait for the new version; don't bother with the old one --
The version of INT.TXT that I gave you on Thursday is now
completely out of date; the tentative proposals in that version are
being fundamentally revised in the light of new insights. The new
proposals will be much better founded and much less tentative.
∂15-Oct-78 1200 JB
∂11-Oct-78 1331 JMC
I have read your draft.
∂11-Oct-78 1333 JMC thesis draft
The introduction is ok, but I have made numerous suggestions on the
English. The structure section requires examples of the effects
of GOL commands. I don't understand the relation of MONADIC to
UNIVERSAL-EXISTENTIAL. These seem quite different to me. What is
the state of the remaining sections of the thesis? I have put my
marked up copy in your box.
Dear John:
thank you very much for your reading and your feedback. I will
dedicate this week to completing the manuscript.
The remaining sections, I have thought about them but not started
writing before hearing of your feedback. I think they should offer no
problem.
MONADIC vs. UNIVERSAL-EXISTENTIAL:
My observations about this are based on what I have heard from RWW.
I don't know or understand the MONADIC code (written by Bill Glasmire).
I may have misunderstood what RWW said about the relationship between
these two. He has said to me that Bill's code is not really the decision
procedure for monadic predicate calculus, but a decision procedure for
formulae that transform to a universal-existential prenex normal form.
The decision procedure for monadic predicate calculus does not quite
apply, because the monadic pred. calc. assumes there are no function
symbols (if I have understood this correctly), and that is not the case
in FOL.
I will take further steps to clarify this issue.
∂16-Oct-78 0850 BPM FLASH: Herb Simon wins Nobel Prize
To: "@SIMON.DIS[1,BPM]" at SU-AI
a050 0331 16 Oct 78
PM-Nobel-Economics,90
BULLETIN
STOCKHOLM, Sweden (AP) - American economist Herbert Simon, who
pioneered organization theories, was awarded the 1978 Nobel Prize for
Economic Science today.
Simon, 62-year-old professor at Carnegie-Mellon University in
Pittsburgh, Pa., was cited by the Swedish Academy of Sciences ''for
his pioneering research into the decision-making process within
economic organizations.''
Simon is the seventh American to win the economics prize in the 10
years it has been awarded.
ap-ny-10-16 0637EDT
- - - - - -
a057 0423 16 Oct 78
PM-Nobel-Economics, 1st Add, a050,290
URGENT
STOCKHOLM: been awarded.
He is also the fourth American to win a Nobel award this year. The
others so far this year are Yiddish author Isaac Bashevis Singer, who
won the prize for literature, and microbiologists Daniel Nathans and
Hamilton C. Smith of Johns Hopkins University in Baltimore, who
shared the prize in medicine with a Swiss, Werner Arber of the
University of Basel.
Simon, a native of Milwaukee, has been professor of computer
sciences and psychology at Carnegie-Mellon since 1965. He is the
author of the 1958 bible of business administration, titled
''Organizations,'' and has also held professorships in political
science, administration and information sciences. But the Swedish
Academy said he has also made significant contributions in the fields,
among others, of science theory, applied mathematics, statistics,
operations analysis, economics and business administration.
''In all areas in which he has conducted research, Simon has had
something of importance to say and, as a rule, has developed his ideas
to such an extent that it has been possible to use them as basis for
empirical studies,'' the citation continued.
''But he is, most of all, an economist - in the widest sense of that
word - and his name is associated most of all with publications in
structure and decision-making within economic organizations, a
relatively new area of economic research.''
The Nobel Prizes this year are worth $165,000. The economics prize,
a comparative newcomer to the group of awards, was set up by the
Swedish Central Bank in 1968 and was first awarded in 1969.
The five other awards were established by the will of Alfred Nobel,
the Swedish inventor of dynamite, and were first awarded in 1901.
This year's prizes for physics, chemistry and peace are still to be
announced.
ap-ny-10-16 0728EDT
- - - - - -
a059 0435 16 Oct 78
PM-Nobel-Economics, 1st Ld, a050,130
Eds: clarifies basis of award and includes quotes from Simon.
STOCKHOLM, Sweden (AP) - American economist Herbert Simon was
awarded the 1978 Nobel Prize for Economic Science today for pioneering
research in the ''decision-making process within economic
organizations.''
The Swedish Academy of Sciences also hailed the 62-year-old
professor at Carnegie-Mellon University in Pittsburgh for his work in
numerous related fields.
Simon, interviewed by telephone at his home, said he was ''very
surprised and very pleased'' at the award.
He said the prize apparently was given to him for work he did about
20 years ago ''on how people make decisiions in complex
organizations.''
Simon said he built some ''theories of decision making which took
into account the limited information that people have and the limits
on their ability to make elaborate calculations.''
Simon is: 3rd graf.
ap-ny-10-16 0740EDT
***************
∂16-Oct-78 1047 JB
∂16-Oct-78 0846 RWW
MONADIC was implemented by Bill using Quine's method of reducing monadic
sentences to sentences of the form ∀∀∀∀∃∃∃∃ called variously
"universal-existential", "AE", or "∀∃". The decision procedure for
these was well known in the thirties. MONADIC actually uses the more
general decision proceedure to decide ∀∃ formula that it has found.
Function symbols are handled in some reasonably but ad hoc way. I am
not sure how.
∂17-Oct-78 1049 CET
To: EAF at SU-AI, DEK at SU-AI, JMC at SU-AI, GHG at SU-AI,
LES at SU-AI, REG at SU-AI, DPB at SU-AI
10/17 10:15
Tom Allen of IBM (San Francisco - 545-2931) called to extend an invitation
to Profs. Feigenbaum, Knuth, Golub, McCarthy,
Ralph Gorin, Denny Brown, Les Earnest
Tom Allen of IBM San Francisco (545-2931) called this a.m. to extend
an invitation to a seminar which will be held at the San Jose office.
Thursday October 26 beginning noon with lunch - dinner that evening
and ending with lunch on Friday October 27.
One year ago they introduced a Series 1 mini-computer and the seminar is
to introduce it to the major Univ. people of the west coast. They wish to
describe the hardware and software to attendees (about 30).
Two guest speakers are Paul Dirkson, Director of Computing at Univ. of
Waterloo, who will speak Thursday evening 8-10, and Bob O'Desky of the
Univ. of Missouri Med. Computer Center, who will speak Friday 9:45-noon.
Mr. Allen will check with me for RSVP's.
Carolyn
∂17-Oct-78 1738 ARK S-1 Meeting Notice
To: S1 at SU-AI
There will be a general S-1 Meeting on Wednesday, 18 October at 1:15 p.m.
in the Serra Conference Room.
Arthur
∂17-Oct-78 2322 TOB mech eng
John
Would you agree to Prof Larry Leifer, Mech Eng,
getting an account at AI?
Tom
∂17-Oct-78 2348 TOB Leifer account
John
Leifer wants primarily to use editing facilities.
I support it because he and I will be collaborating
on development of sensors and sensor-controlled
grasping, and because he is interested in the
Advanced Automation Center.
Tom
Where will he do his work, and does he plan on having anyone else
use the computer on the same account?
∂18-Oct-78 0005 TOB Leifer
He will work remotely with a Datamedia (I think)
and I am not sure, but I suspect that he will
ask that two students get accounts, two who
are working on using Scheinman arm in rehabilitation.
Tom
∂18-Oct-78 0211 MRC DLNSTA
To: IAZ, JMC, LES
DLNSTA HAS BEEN ENHANCED TO PROVIDE SOME MORE STATUS INFORMATION. UNDER
"STATE", THERE ARE FIVE POSITIONS WHICH EITHER ARE BLANK OR HAVE A LETTER.
THE LETTERS ARE:
I AN INT PACKET WAS RECEIVED, AND IO%INT IS SET IN THE USER'S I/O
STATUS WORD.
C A CLS PACKET WAS RECEIVED, AND IO%CLS IS SET IN THE USER'S I/O
STATUS WORD.
E AN EOF PACKET WAS RECEIVED, AND IO%EOF IS SET IN THE USER'S I/O
STATUS WORD.
O A CONNECTION IS FULLY OPEN RIGHT NOW
D THE PORT IS "DIALED IN", IE, THERE IS CARRIER.
NORMALLY, DLN0 AND DLN3 WILL HAVE NO STATUS FLAGS. DLN1 AND DLN2 WILL HAVE
D, SINCE THEY ARE SUPPLYING EACH OTHER CARRIER. THE NORMAL STATE WHEN A
DIALNET HACKING PROGRAM IS RUNNING IS FOR O AND D TO BE SET.
-- MARK
∂18-Oct-78 0807 DEK TEX manual corrections
Thanks for your messages. I decided to plant a reference on page 29 to
Appendix F, where all of the control sequences for special symbols are
listed. The index does have some entries relating to $'s. The duplicated
index entry for "spacing..." almost makes it look as if I prepared the
index with a computer.
∂19-Oct-78 0024 BLH Corrections to "LISP: Programming and Proving"
To: JMC
CC: BLH
While reading the CS206 text "LISP: Programming and Proving" (version
dated 5:21 on Sept 18, 1978): I notice the following errors:
1) pg 5/4th line from the bottom -
"...(A . (B . (C . (... (Z . NIL) ...)))." should be changed to
"...(A . (B . (C . (... (Z . NIL) ...))))."
2) pg 6/exercise 3 -
"...the list ((PLUS (TIMES X Y) X 3) as an ..." should be changed to
"...the list (PLUS (TIMES X Y) X 3) as an ..."
3) pg 6/exercise 4d -
"((A . B) . ((C . D) . NIL)." should be changed to
"((A . B) . ((C . D) . NIL))."
4) pg 8/second paragraph line 3 -
"...if ¬atx there are S-expressions there must be S-expressions y and z..."
should be changed to
"...if ¬atx there must be S-expressions y and z..."
---Bruce L Hitson
Thanks for the errata.
∂19-Oct-78 1129 CET
John,
Juan Bulnes presented a paper entitled "A Natural Way to do Spatial
Linear Geometry in MACSYMA" at the First MACSYMA Users Conference
July 1977 in Berkeley. It was published in Proceedings of the Conf.
Does this fulfill the seminar requirement for him?
Thanks, Carolyn
Yes, it does - JMC.
∂19-Oct-78 1901 100 : rwg
if it has no trade-in value, wd wants your old hot water heater.
∂20-Oct-78 0222 ALL Macro Processor for PASCAL
To: "@S1[DIS,S1]" at SU-AI
An initial specification for the macro preprocessor for PASCAL can be
found in PASMAC.LOG[DOC,S1]. Any comments/suggestions are appreciated.
Perhaps a meeting can be arranged on this topic for sometime next week.
Please route all feedback to ALL@SU-AI. Thanks.
∂20-Oct-78 1332 JBR
To: MRC at SU-AI
CC: BH at SU-AI, ME at SU-AI, JMC at SU-AI
BREAKDOWNS:
USER TIME: 14728 USER CODE 70.4% 38.5%
6119 UUO'S 29.2% 16.0%
53 SPACEWAR 0.2% 0.1%
SYSTEM TIME: 0 CHANS 1-5 0.0% 0.0% (BAD, YET SIMPLE, ESTIMATE)
1744 CHANNEL 6 10.0% 4.5%
15562 CHANNEL 7 89.9% 40.7%
CHANNEL 7 TIME:
0: 4851 31.1% 12.6% MISCELLANEOUS
1: 139 0.8% 0.3% COMMAND PROCESSING
2: 42 0.2% 0.1% SWAPPER (SCNIN)
3: 27 0.1% 0.0% SWAPPER (SCNOUT)
4: 574 3.6% 1.5% SWAPPER (OUTJOB)
5: 298 1.9% 0.7% SWAPPER (INJOB)
6: 1244 7.9% 3.2% SCHEDULER (NXTJOB-EXCLUSIVE OF SWAPPING)
7: 708 4.5% 1.8% USER INTERRUPT HANDLER
10: 712 4.5% 1.8% SWAPPER (MISC.)
11: 33 0.2% 0.0% SERVICE THE PDP-6
12: 746 4.7% 1.9% APRMAP
13: 191 1.2% 0.4% CSHSET
15: 1610 10.3% 4.2% CONTEXT SWITCHING
16: 88 0.5% 0.2% CALC. JOB PRIORITIES
17: 476 3.0% 1.2% CLOCK REQUEST HANDLER
21: 386 2.4% 1.0% FSCLK,SFSCLK
22: 70 0.4% 0.1% CLOCK REQUEST ROUTINES
23: 386 2.4% 1.0% SERVICE IMP
31: 90 0.5% 0.2%
32: 1052 6.7% 2.7% DPYCLK (QBLOCK)
33: 387 2.4% 1.0% DPYCLK (DPLED)
34: 620 3.9% 1.6% DPYCLK (DPYTYP)
35: 192 1.2% 0.5% DPYCLK (F.S.HANDLER)
36: ↑C
.r ppsav
In response to MRC's note about his rewrite to the command decoder:
Note how much time was spent command processing. This number is always
that low. I think it was silly to rewrite the command decoder if the
reason was to improve its efficiency. It will never make up in performance
anywhere near the downtime it will cost to debug it.
∂22-Oct-78 0618 PLS Concept paper
The file comjmc[1,pls] has some comments on your concepts paper.
∂22-Oct-78 2052 LCW
To: "@S1[DIS,S1]" at SU-AI
Mail File Deleted
Someone deleted my mail file between 1800 and 1812 on Sunday, October 22.
I had been gone for a full week prior to this, and thus failed to receive
any mail sent during that week. If you want me to see something mailed to
me last week, then send it again. Curt
∂23-Oct-78 0117 NS
To: JMC
Your following News Service notification
request(s) will expire within a week:
(annapurna)/AP/NYT
∂23-Oct-78 0249 DCL
To: "@GROUP.DIS[VCG,DCL]" at SU-AI
***********************************************************************
VERIFICATION GROUP SEMINAR
TUESDAY 24TH OCTOBER
PLACE: ERL 237
TIME: 2:30 p.m.
TITLE: Second Order Process Logic
SPEAKER: Professor Rohit Parikh
M.I.T.
Abstract
Second Order Process Logic is a formal language for describing programs
and computations. It is an extension of Dynamic Logic. There is no decision
procedure for the correctness (satisfiability) of arbitrary formulas of
process logic.
A sublanguage called SOAPL (Second Order Acyclic Process Logic) will be
presented, and it will be shown that its satisfiability problem is decidable.
This result implies the decidability of propositional dynamic logic
(previously proved by Fischer and Lardner), the decidability of Pnueli's
Temporal Logic for specifying processes, and several other recent results.
∂23-Oct-78 1028 DWW Modal Logic Seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
Thursday, Oct. 26 David Wall
"Is 'Sometime' Sometimes Somewhat Better Than 'Always' in Some Ways?"
ERL 237 2:45-4:00
Abstract
We will explain Manna's Intermittent Assertion method of program
verification, and discuss and evaluate it in the light of the objections
to it raised by Gries. No prior knowledge of this method is assumed.
∂23-Oct-78 1325 SJF Parikh's talk at Luckham's seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
See PARIKH.TXT[1,SJF] for summary. The talk may interest all you modal
logic groupies all there.
Shel
∂23-Oct-78 1332 SJF correction
To: "@MODAL.DIS[1,SSO]" at SU-AI
Make that "out there". (How many of us are "all there"?)
∂23-Oct-78 1445 ME NS errors
NS should work OK now, although future data file clobberage may
result in its dying later.
∂23-Oct-78 1638 Bmoore at SRI-KL (Bob Moore) References to my MS thesis
Date: 23 Oct 1978 1640-PDT
From: Bmoore at SRI-KL (Bob Moore)
Subject: References to my MS thesis
To: jmc at SAIL
I have found the following references to my MS thesis
(1) Bledsoe's paper "Non-resolution Theorem Proving" in the AI Journal
Vol. 9, No. 1, August 1977.
(2) Drew McDermott's IJCAI77 paper "Vocabularies for Problem Solver State
Descriptions"
(3) Fikes and Hendrix's IJCAI77 paper "A Network-Based Knowledge Representation
and its Natural Deduction System"
(4) Drew McDermott's invited review paper for the 1978 AISB/GI AI Conference
"The Last Survey of Representation of Knowledge"
(5) Nils Nilsson's contribution to the forthcoming MI9 volume "A Production
System for Automatic Deduction", also published as Stanford CSD Report
No. STAN-CS-77-618
The thesis will also be referenced in Nils's new book, but he has not finished
writing it yet. Also, it has been referenced by some other MIT theses,
including McDermott's doctoral thesis and Rich and Shrobe's MS thesis, but
I doubt that would carry any weight.
Thanks again for recommending my thesis,
Bob
-------
∂24-Oct-78 0304 MRC new Dialnet service
The next version of DLNSER, hopefully up Tuesday evening, will have a new
I/O status bit (the 1000 bit) meaning that data was missed because the user
has not been reading her input stream fast enough, allowing packets to pile
up on the input list until the window was exceeded. Previously this
condition logged a message on the CTY and proceeded anyway. If allowed to
go on for long enough, the system would have run out of free storage and
crashed. The new DLNSER protects against this from happening.
MTAPE function 10 will return a block of performance statistics. What it
will return is mostly up to my whims and fancies; see DLNSER.DOC[S,SYS] for
today's definition of what the statistics are. This will allow metering of
line noise and system response conditions. DLNSTA will report this stuff
when it's available.
∂24-Oct-78 0946 Mcgoveran at SUMEX-AIM DEC System Proposal
Date: 24 Oct 1978 0947-PDT
From: Mcgoveran at SUMEX-AIM
Subject: DEC System Proposal
To: FXB at SAIL, EJM at SAIL, JLH at SAIL, WVC at SAIL,
To: Wiederhold, JMC at SAIL, LES at SAIL, REG at SAIL
cc: Feigenbaum
I am writing for Ed Feigenbaum, who would like to set up a meeting this
Wednesday at 2:30 or so to discuss the DEC 2060 acquisition, installation,
and operation. Ed asks that you attend this meeting and said that other
CSL and CS faculty who are interested are welcome to attend also. Please
let me know if this time is convenient for you.
Mary
-------
∂24-Oct-78 1218 TED
Deepest sympathy. Let me know if I can help out in any way.
∂24-Oct-78 1355 Mcgoveran at SUMEX-AIM DEC System Proposal meeting
Date: 24 Oct 1978 1355-PDT
From: Mcgoveran at SUMEX-AIM
Subject: DEC System Proposal meeting
To: FXB at SAIL, EJM at SAIL, JLH at SAIL, WVC at SAIL,
To: Wiederhold, JMC at SAIL, LES at SAIL, REG at SAIL
An item I left out of my memo this morning: The meeting would be
held in McCullough 240.
Mary
-------
∂24-Oct-78 1404 Hart at SRI-KL (Peter Hart)
Date: 24 Oct 1978 1406-PDT
From: Hart at SRI-KL (Peter Hart)
To: JMC at SU-AI
cc: Hart
John,
Please accept my condolences on this unhappy occasion. Let
me know if I can help in any way.
Peter
-------
∂24-Oct-78 1416 REF
Did your "Concept Valued Functions" paper every get "published"?
Can I have a reference (bibliography-type reference).
Thanks.
bob
It will be published in MI9.
∂24-Oct-78 1422 Rindfleisch at SUMEX-AIM CONDOLENCES
Date: 24 Oct 1978 1423-PDT
From: Rindfleisch at SUMEX-AIM
Subject: CONDOLENCES
To: MCCARTHY at SU-AI
John,
I just heard about Vera's accident and want to express my deepest
sympathies. It is always hard to find useful words for times like this;
all the more so in the midst of the exhilaration of Vera's success in
climbing Annapurna.
Tom R.
-------
∂24-Oct-78 1502 REP CS-206
To: JMC, HVA
I will plan on assumming full responsibility for CS-206 until John
notifies me otherwise.
Rich
∂24-Oct-78 1451 HVA TELEPHONE CALL FROM SAN JOSE MERCURY
A call from Cathy Castillo, San Jose Mercury (941-4813), for you was referred
to me - she said she had a "garbled story from Kathmandu" and she wanted to
talk to you. I said you were out of the office this afternoon, but that I
would give you the message when you called us - I suggested you might be out
of town, when she said she might try you at home this evening.
There were two other telephon calls:
Fran Allen (10:25 a.m.) - please call her at home (914)271-3494
Nancy at EES (7-4169), confirming an appointment Wed.10/25, at 3:00 p.m in
your office, with Dr. Earnest Ambler, National Bureau of Standards.
If there are any calls you would like me to make for you, or any particular
way you would like them handled, please let me know. If there is anything
else we can do, please let me know - I hope it was all right to keep in touch
through the system - it seemed less intrusive. My best.
∂24-Oct-78 1505 HVA CS 206
CC: REP, JMC
Thank you, Rich - that seems best idea - let me know if you need any XEROX
help, etc.
∂24-Oct-78 1710 ALL Pascal Macros
To: "@S1[DIS,S1]" at SU-AI
All further mail regarding the macro processor for pascal should
be sent to PASMAC[DIS,S1]. thanks, amy
∂24-Oct-78 2018 DCO
To: DCL, JMC
The Takeuchi Function.
The following function is due to Takeuchi:
tak(x,y,z) = if x ≤ y then y
else tak(tak(x-1,y,z), tak(y-1,z,x), tak(z-1,x,y));
John McCarthy has a hand proof that the function satisfies the following:
tak(x,y,z) = if x ≤ y then y else if y ≤ z then z else x;
The following proof of partial equivalence (no termination) was done by
Peter Milne. It requires no rules or other information, only the simplifier.
PASCAL
FUNCTION TAK(X,Y,Z:INTEGER):INTEGER;
ENTRY TRUE;
EXIT(X≤Y∧TAK=Y)∨
(X>Y∧((Y≤Z∧TAK=Z)∨
(Y>Z∧TAK=X)));
BEGIN
IF X≤Y THEN TAK←Y ELSE TAK←TAK(TAK(X-1,Y,Z),
TAK(Y-1,Z,X),
TAK(Z-1,X,Y));
END;
EXIT TRUE; BEGIN END.
.... leads to the following verification conditions
....
Unsimplified Verification Condition: MAIN 1
TRUE
Unsimplified Verification Condition: TAK 1
(X≤Y
→
X≤Y ∧
Y=Y ∨
Y<X ∧
(Y≤Z ∧
Y=Z ∨
Z<Y ∧
Y=X))
Unsimplified Verification Condition: TAK 2
(¬(X≤Y) ∧
(X-1≤Y ∧
TAK(X-1,Y,Z)=Y ∨
Y<X-1 ∧
(Y≤Z ∧
TAK(X-1,Y,Z)=Z ∨
Z<Y ∧
TAK(X-1,Y,Z)=X-1)) ∧
(Y-1≤Z ∧
TAK(Y-1,Z,X)=Z ∨
Z<Y-1 ∧
(Z≤X ∧
TAK(Y-1,Z,X)=X ∨
X<Z ∧
TAK(Y-1,Z,X)=Y-1)) ∧
(Z-1≤X ∧
TAK(Z-1,X,Y)=X ∨
X<Z-1 ∧
(X≤Y ∧
TAK(Z-1,X,Y)=Y ∨
Y<X ∧
TAK(Z-1,X,Y)=Z-1)) ∧
(TAK(X-1,Y,Z)≤TAK(Y-1,Z,X) ∧
TAK(TAK(X-1,Y,Z),TAK(Y-1,Z,X),TAK(Z-1,X,Y))=TAK(Y-1,Z,X) ∨
TAK(Y-1,Z,X)<TAK(X-1,Y,Z) ∧
(TAK(Y-1,Z,X)≤TAK(Z-1,X,Y) ∧
TAK(TAK(X-1,Y,Z),TAK(Y-1,Z,X),TAK(Z-1,X,Y))=TAK(Z-1,X,Y) ∨
TAK(Z-1,X,Y)<TAK(Y-1,Z,X) ∧
TAK(TAK(X-1,Y,Z),TAK(Y-1,Z,X),TAK(Z-1,X,Y))=TAK(X-1,Y,Z)))
→
X≤Y ∧
TAK(TAK(X-1,Y,Z),TAK(Y-1,Z,X),TAK(Z-1,X,Y))=Y ∨
Y<X ∧
(Y≤Z ∧
TAK(TAK(X-1,Y,Z),TAK(Y-1,Z,X),TAK(Z-1,X,Y))=Z ∨
Z<Y ∧
TAK(TAK(X-1,Y,Z),TAK(Y-1,Z,X),TAK(Z-1,X,Y))=X))
.... which leads to the following proof:
Hi Derek, welcome to the Pascal Verifier.
Version (SIMP 24.) (October 24 1978)
Simplifier Only.
Type 'HELP;' for help
>Reading file: DEREK1.CVC
>Loaded: (MAIN TAK)
>>
Simplified Verification Condition: MAIN 1
TRUE
Simplified Verification Condition: TAK 1
TRUE
Simplified Verification Condition: TAK 2
TRUE
% CPU seconds: 2.327 %
.
∂24-Oct-78 2125 JP InterLISP manual
To: "@ILISP.DIS[1,JP]" at SU-AI
Your request has been forwarded to PARC.
∂24-Oct-78 2131 DCL
To: LES
CC: RAK, SMG, JMC
∂24-Oct-78 1509 SMG
To: DCL, RAK
∂23-Oct-78 1214 RAK
To: SMG
CC: DCL
∂21-Oct-78 0135 SMG From SMG via maclsp
simpler example- there is a much smaller example of the same readvc bug
on GOMORY.SMP[VER,SMG]
[This "much smaller" example is 265 lines long.
Steve, I'll be happy to try to fix it, but even if it only takes a "few
CPU seconds" to read it in, it takes CPU hours to read in anything this
long with any form of tracing. In addition, it must be run over and over
again. Therefore, the first, important, step is to reduce it to the minimal
length possible.
I'll be happy to fix it, and do the work of finding a minimal example,
but I am not going to do it know when the load average is running around
9. You will help me by producing a very short example, but you don't have
to. I ask you to consider the psychology of it: if someone gave you a
5 line VC that failed and a 265 or 530 line one, which one would you be
likely to try first?
Dick
]
[Well, we are witnessing the slow death of our research project because high
load averages make it impossible to maintain the verifier. I am not convinced
that the current situation with the system cannot be changed. There may
continue to be too many users. Maybe we need to have several ultra-super
users in our group, with say 500 bams.
s
]
TO LES: IN VIEW OF OUR 4% SHARE OF THE MACHINE, AND OUR DIFFICULTY IN GETTING
VERIFIER MAINTENENCE DONE, WOULD YOU PLEASE LET RAK AND SMG ALSO BE SUPER
USERS.
∂25-Oct-78 0848 Feigenbaum at SUMEX-AIM Tried to get you last night
Date: 25 Oct 1978 0849-PDT
From: Feigenbaum at SUMEX-AIM
Subject: Tried to get you last night
To: jmc at SAIL
John,
Penny and I tried to reach you early last evening to see if you
were home. We wanted to come over to visit and talk. But there was no
answer so we did not go over.
We are overwhelmed by the magnitude of the tragedy and feel very deeply
for you and your loss. We don't know how to put it into words.
Ed
-------
∂25-Oct-78 1027 CLT
John,
Hershey just told me about Vera. I am very sorry to hear such bad news.
If there is anything at all I can do please let me know.
Carolyn
∂25-Oct-78 1038 PAT
John,
Hersche called me about Vera, words can't seem to express my feelings.
If there is anything you would like me to do, please let me know....Let me
know what you want to do about phone calls and your appointments for the
next few weeks. For the moment we are not saying anything and just taking
messages. Take care,
Patte
∂25-Oct-78 1047 CH
THE MEETING OF THE COMMITTEE ON TASK FORCE ON THE FUTURE OF COMPUTING AT
STANFORD SCHEDULED FOR THIS EVENING AT 7 PM IS CANCELLED. NO NEW TIME
HAS BEEN RESCHEDULED FOR THIS MEETING. NEXT REGULARLY SCHEDULED MEETING IS
NOV. 2.
MY HEART IS WITH YOU EVEN THOUGH I DID NOT KNOW YOUR WIFE. PLEASE LET ME KNOW
IF I CAN DO ANYTHING FOR YOU. CHARLIE
∂25-Oct-78 1110 RWW
John - I have been tongue tied since yesterday when I heard about Vera.
I'm very sorry. If you need anything let me know.
richard
∂25-Oct-78 1206 TW vera
Ed just told me the news, and it really upset me.
I know there's not much to be said at this point,
but I just wanted to let you know that lots of us
will feel the loss along with you.
--terry
∂25-Oct-78 1947 Jrobinson at SRI-KL (Jane Robinson) dinner thursday
Date: 25 Oct 1978 1753-PDT
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: dinner thursday
To: mccarthy at SU-AI
John,
Margaret is coming also. I'll be home by 6:30 pm, so feel free to show
up any time after that. I'll aim for dinner around 7:30 but it can be
later.
Until then,
Jane
-------
The timing is fine, and many thanks. I'll want to ask some questions
about Vera that I never brought myself to ask her.
∂25-Oct-78 2341 ZM
John,
I was very sorry to hear the bad news about Vera.
PLEASE, let me know if I can be of any help. yours Zohar
∂26-Oct-78 0109 WD
To: JMC, WD
You're extremely welcome.
∂26-Oct-78 0122 MRC Dialnet performance statistics
DLNSTA now reports the newly-implemented Dialnet performance statistics.
Try R DLNSTA and see. There have been a few framing and checksum errors,
but not enough to account for the large amount of retransmission observed.
Possibly not all framing errors are being counted however; I will
check on that. Otherwise there might be a bug in the output queueing
logic; but I don't think it's possible (if there were such a bug I don't
understand how it could work at all).
-- Mark
∂26-Oct-78 0751 PRATT at MIT-AI (Vaughan Pratt)
Date: 26 OCT 1978 1018-EDT
From: PRATT at MIT-AI (Vaughan Pratt)
To: DEK at MIT-AI, DCL at MIT-AI, ZM at MIT-AI, JMC at MIT-AI
To: DCO at MIT-AI
I would be interested in taking a year's sabbatical (or at least leave
of absence) from MIT in 79/80 in order to work with the verification
people at Stanford. Would Stanford be interested in having me around
for the year? I would be willing to teach a course or two, depending
on your needs. My main objective would be to collaborate with Derek
Oppen on verification technology, but I would also welcome the opportunity
to broaden my perspectives by interacting with other people. If Derek
wants to take that year off from Stanford, I'll wait a year.
Cheers
Vaughan
∂26-Oct-78 0754 Feigenbaum at SUMEX-AIM Stanford News Service: Bob Byers
Date: 26 Oct 1978 0755-PDT
From: Feigenbaum at SUMEX-AIM
Subject: Stanford News Service: Bob Byers
To: jmc at SAIL
...just called. Expressed in mildly abrasive terms his irritation at
not being given ALL the news RIGHT NOW.
Expressed a wilingness to act as a means of distribution of the story.
Ed
-------
∂26-Oct-78 0800 Buchanan at SUMEX-AIM
Date: 26 Oct 1978 0800-PDT
From: Buchanan at SUMEX-AIM
To: jmc at SU-AI
John,
Sally and I offer our deepest sympathies on your loss. Vera
was one of the special people of the world who will be missed by all
who knew her.
Bruce
-------
∂26-Oct-78 0820 CH
JOHN COLEMAN OF UPI CALLED AND WANTED TO TALK WITH YOU ABOUT OBTAINING A
PICTURE OF YOUR WIFE. HE CAN BE REACHED AT (408)736-7688.
∂26-Oct-78 0847 CH
PLEASE CALL RUCH MARIE SHORT AT (9) 326-6200 EXT 3332. THANK YOU
Please find out what she wants.
∂26-Oct-78 0944 Feinler at SRI-KL (Jake Feinler) Very sad news
Date: 26 Oct 1978 0946-PDT
From: Feinler at SRI-KL (Jake Feinler)
Subject: Very sad news
To: jmc at SU-AI
cc: feinler
Dear John,
I was shocked to hear the news on the radio this morning
and have been thinking about you all this morning. I
remember the day we stood talking outside of the LBL meeting
and I was thinking what an intelligent warm person she
was. We can never know what Fate has planned and therein
lies both the joy and sadness of life. Vera lived life fully,
and was with friends in an exciting endeavor at the end...and
perhaps that was really a beginning, we don't really know.
These next few days and months will be hard ones for you,
I'm sure, and I just wanted you to know that many of
us are thinking of you and send our deepest sympathy.
Jake
-------
∂26-Oct-78 1010 CH
Ruth Marie Short of SRI is trying to locate a paper entitled "Solving
inequalities associated with computer program passes" authored by Mike
Green. A Japanese client wants a copy of it. She thought you might be
aware of where she might be able to locate a copy of this.
Please tell her that I don't know Mike Green or the paper in question.
∂26-Oct-78 1030 Levinthal at SUMEX-AIM condolences
Date: 26 Oct 1978 1021-PDT
From: Levinthal at SUMEX-AIM
Subject: condolences
To: mccarthy at SU-AI
Dear John,
I was shocked and saddenned to learn about your wife's
death. I realize that nothing I say can be of any help, but
I want you to know that you have my deepest sympathies.
Sincerely, Elliott
-------
∂26-Oct-78 1033 PAT whit diffie
I have a request for a paper of Whit's. Where should I send it?
Whit is a grad student in EE with Martin Hellman, but you can
send him a message as WD.
∂26-Oct-78 1054 Bmoore at SRI-KL (Bob Moore)
Date: 26 Oct 1978 1056-PDT
From: Bmoore at SRI-KL (Bob Moore)
To: jmc at SAIL
Dear John,
Rita and I were stunned and deeply moved by the news of
Vera's death. Though we met her only a few times, her
warmth, vitality, and zest for life were obvious, and we
felt that she was our friend. I hope that you can take
comfort in the fact that she was doing what she loved and
facing the challenge on its own terms, completely aware of
the risks. I know that this must be a very difficult time
for you. If there is anything that we can do, please don't
hesitate to let us know.
Deepest Regards,
Bob
-------
∂26-Oct-78 1325 LCW Net Proposals
To: "@S1[DIS,S1]" at SU-AI
In the future, all proposals and interim specifications relating to the
Net should go into NET.LOG[DOC,S1]; if documentation about the Net is
distributed it will be lost. I have moved PROTO.COL[11,S1] into NET.LOG,
and copied NEW.PRO[P11,HWC] into NET.LOG. NEW.PRO[P11,HWC] should be
deleted by HWC.
The policy of placing interim documentation in the appropriate log also
applies to all other Project areas; only final documentation should be in
separate files, and those should be located in [DOC,S1] and *indexed* in
INDEX[DOC,S1].
Curt
∂26-Oct-78 1448 Mcgoveran at SUMEX-AIM Faculty Meeting
Date: 26 Oct 1978 1419-PDT
From: Mcgoveran at SUMEX-AIM
Subject: Faculty Meeting
To: faculty.list:
This memo is being sent to set up a faculty meeting for November 7 at 2:30.
This meeting is in the nature of an emergency meeting to discuss the
potential impact on the department of the possible change in the way
graduate tuition remission is handled. The move to a direct charge to
projects for the tuition of an RA may have a large financial effect on our
projects, and it may result in our being able to support fewer students.
If so, the University needs to know now so that suitable protection can be
launched.
Other items will be discussed.
Mary
-------
∂26-Oct-78 1534 MINSKY at MIT-AI (Marvin Minsky) Couldn't reach you by phone.
Date: 26 OCT 1978 1834-EDT
From: MINSKY at MIT-AI (Marvin Minsky)
Subject: Couldn't reach you by phone.
To: jmc at SU-AI
All possible sympathy from Gloria and me and family.
Don't hesitate if we can do anything.
--Marvin
∂28-Oct-78 1522 Feldman at SUMEX-AIM Condolences
Date: 27 Oct 1978 0640-PDT
From: Feldman at SUMEX-AIM
Subject: Condolences
To: jmc at SU-AI
John,
I was gratly saddened to hear of your loss.
Jerry F./
-------
∂28-Oct-78 1532 KNUTH at MIT-MC (Donald E. Knuth)
Date: 27 OCT 1978 1950-EDT
From: KNUTH at MIT-MC (Donald E. Knuth)
To: jmc at SU-AI
(I guess computer mail is no more inadequate than other forms of
communication with respect to expressing deeply held feelings in words.)
I want to say how much I share your shock and grief at the tragic news
of Vera's accident.
She was one of the most admirable people I have ever had the opportunity
to know.
We can be thankful for the many outstanding and beautiful things she
accomplished during her brief but richly filled life.
∂28-Oct-78 1533 Wiederhold at SUMEX-AIM S-1 Meeting
To: S1 at SU-AI
Date: 27 Oct 1978 1650-PDT
From: Wiederhold at SUMEX-AIM
Subject: S-1 Meeting
To: S1 at SAIL
There will be an S-1 meeting on Wednesday, 1 November
at 1:15 p.m. in the Serra House Conference Room.
-------
∂28-Oct-78 1555 Wiederhold at SUMEX-AIM S-1 Meeting
To: S1 at SU-AI
Date: 27 Oct 1978 1650-PDT
From: Wiederhold at SUMEX-AIM
Subject: S-1 Meeting
To: S1 at SAIL
There will be an S-1 meeting on Wednesday, 1 November
at 1:15 p.m. in the Serra House Conference Room.
-------
∂29-Oct-78 1633 PAT vacation plans
To: HVA, LES, JMC, MUZ, JC
I am off and away for the next two weeks...places I can be reached are in my
plan file...patte
∂30-Oct-78 0912 AFB
Yes..
You must have forgotten.
(which is a bit upsetting to a 1st-yr-er like me)
I asked you about it
in my previous letter and mentioned it again when I came to see you
in response to what courses I was taking.
Since I didn't hear otherwise I assumed it was alright. Is it ok
I am engaging in independent reading on the general
subject of AI--partly in preparation for the comprehensive and partly
to satisfy my own curiosity and partly to see if there is anything out
there that I want to do.
I hope this is enough in the spirit of a 390.
Please advise if there are any objections.
Anne Beetem
It's ok, and I suppose I forgot because we haven't met to discuss your
progress. If you want to do it, I am available. The purely bureaucratic
part is no problem.
∂31-Oct-78 1250 BTH Modal Logic Seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
Thursday, Nov. 2 Brent Hailpern
Pnueli's "A Temporal Semantics for Concurrent Programs"
ERL 237 2:45-4:00
Abstract
A survey of Pnueli's paper will be given emphasizing the "full-semantic
specification" formula technique. If time permits, a proof of a semaphore
implementation of critical regions will be presented.
∂01-Nov-78 0826 ACH via UTAH-TIP BOLLMANN
As a matter of fact, I have only recently put up a new version of reduce at scip.
The right person to talk to about it is June Genis in user services. I don't have her phone number
with me.
I don't know if there is an expert at scip, but he (Bollmann) can always get in
touch with me ...
Incidentally, the scip version includes the latest
University of Cambridge integrator and the portable compiler.
It is interesting to compare the code generated on the 370 vs the DEc 10.
I'm lkeaving for six weeks in Japan in a day or so, therefore any further messages won't
get answered for some time!
I was really sorry to hear about your wife.
Tony
∂01-Nov-78 1309 BTH Modal Logic Seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
Thursday, Nov. 2 Brent Hailpern
Pnueli's "A Temporal Semantics for Concurrent Programs"
ERL 237 2:45-4:00
Abstract
A survey of Pnueli's paper will be given emphasizing the "full-semantic
specification" formula technique. If time permits, a proof of a semaphore
implementation of critical regions will be presented.
∂01-Nov-78 1407 Mcgoveran at SUMEX-AIM Rabin dinner
Date: 1 Nov 1978 1407-PST
From: Mcgoveran at SUMEX-AIM
Subject: Rabin dinner
To: faculty.list:
Dr. Michael Rabin will be giving the Forsythe Lectures on November 6, 8,
and 9. Ed Feigenbaum is extending this invitation to CS faculty to a
dinner with Dr. Rabin following the first lecture on Monday evening.
The dinner will be at the Chef Chu restaurant.
R.S.V.P.
Mary McGoveran
tel. 7-3264
McGoveran@SUMEX
-------
Yes to the dinner with Rabin.
∂01-Nov-78 1529 Nilsson at SRI-KL (Nils Nilsson) Getting together
Date: 1 Nov 1978 1503-PST
From: Nilsson at SRI-KL (Nils Nilsson)
Subject: Getting together
To: Jmc at SU-AI
cc: Nilsson
John, Several of us here at SRI are becoming very interested
in applying ideas about schemes for reasoning about knowledge,
belief, etc. to language generation and understanding. Also we
are interested in some of the other epistemological subjects
that you have been championing for a long time. It would be
useful to us (and maybe entertaining for you) for us to get
together and talk with you about some of these things. If you
are interested, I would suggest at least an initial meeting to
discuss how we ought to proceed or maybe we can begin right
away on some substantive problems. The people here include
Gary Hendrix, Jane Robinson, Bob Moore, and some others including
me. Is there a time next Tues, Wed or Thurs (Nov 7, 8 or 9) that
would be convenient for you to come and talk with us? --Nils
-------
How about Tuesday at 1:30?
I just discovered a conflict.
How about Wednesday at 1:30?
∂01-Nov-78 1536 CLT
To: NONMON.DIS[1,CLT]" at SU-AI
ANNOUNCING
Non-monotonic Logic in 3 Flavors
A mini-conference on non-monotonic logic
Date: Saturday 18th November, 1978
Time: 10am to 5pm (or thereabouts)
Place: Faculty lounge,
3rd floor of the Mathematics Building
Stanford University
Most "mathematical" logics have a property known as monotonicity that can
be described as follows. If you can prove a statement p from a collection
of facts A then p is also provable from any larger collection of facts
containing A.
In AI it is frequently the case that reasoning must be done about
incompletely specified situations. It may be desirable to draw
conclusions (jump to conclusions?) which may be refuted when more
information is obtained. A formalism allowing this is a "non-monotonic
logic".
Several formalisms have been proposed for treating various aspects of
non-monotic reasoning, and it is the purpose of this conference to present
and discuss some of these ideas. There will be talks given by John
McCarthy, Drew McDermott, and Richard Weyhrauch, explaining formalisms
they have developed. Following the talks there will be open discussion
with critical and constructive criticism, comparisions, constrasts and
further ideas welcomed.
For further information contact Carolyn Talcott (CLT@SU-AI) 497-4971.
Please pass the word to anyone you think might be interested. Also note
carefully the date, it has changed since the origonal plans were made.
∂01-Nov-78 1918 LGC Work on Knowledge Representation at SAIL
To: SIGART at MIT-AI
CC: JMC at SU-AI, RWW at SU-AI
Dear Ron and Brian,
Here is the information on our knowledge representation activities
requested in the last SIGART Newsletter:
1a. Spokesperson: John McCarthy
1b. Research Staff: John McCarthy, Richard Weyhrauch, Lewis Creary.
Graduate Students: Robert Filman, Christopher Goad, William Scherlis,
Carolyn Talcott, David Wilkins.
2. Mailing Address: Artificial Intelligence Laboratory
Stanford University
Stanford, California 94305
3a. Project Name: Epistemology of Artificial Intelligence
3b. Description of Work:
Our group is concerned with identifying and representing the kinds of
knowledge that will be required for construction of a sophisticated
general intelligence. Two somewhat different, parallel approaches to
knowledge representation are being pursued within the group, each one
emphasizing in its own way the use of formal logic as a representational
medium.
One approach is primarily concerned with representation of (and
correct reasoning about) complex facts concerning knowledge, beliefs,
desires, and other intentional attitudes. The approach involves
construction of first-order theories of concepts, propositions, and
situations, more or less in the spirit of Frege. A problem solver
implementing many of our ideas in this area is currently being considered.
The other approach, embodied in the FOL system, emphasizes the role
of metamathematical ideas and techniques in knowledge representation. FOL
is an "epistemological laboratory" in which we are investigating a) the
construction of new concepts from old ones, b) the representation of
situations as theories of the world and actions as functions from theories
to theories, c) reasoning about knowledge, d) self-referential reasoning,
and e) perception.
4. ARPANET Address: <person>@SU-AI ; <person>:= JMC | RWW | LGC
∂01-Nov-78 1932 LGC TI Terminal
This is just a reminder to bring in the portable TI terminal that you kindly
offered last week to let me use at home until LES can come up with a CRT
home terminal for me.
∂01-Nov-78 2359 Jrobinson at SRI-KL (Jane Robinson) hello
Date: 1 Nov 1978 2226-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: hello
To: mccarthy at SU-AI
John,
Just to say hello and report plans going ahead ok. And
if you are at loose ends, give a call.
Jane
-------
∂02-Nov-78 1312 CH
PLEASE CALL MARY, SEC TO PENNY GALLOW AT 328-6561, EXT. 207 RE YOUR APPT
TO
∂02-Nov-78 1313 CH
PLEASE CALL MARY, SEC TO PENNY GALLOW AT 328-6561, EXT. 207 RE YOUR APPT
TOMORROW
∂02-Nov-78 1324 Nilsson at SRI-KL (Nils Nilsson) ( Forwarded Mail )
Date: 2 Nov 1978 1314-PST
From: Nilsson at SRI-KL (Nils Nilsson)
Subject: ( Forwarded Mail )
To: JMC at SU-AI
Date: 2 Nov 1978 1313-PST
From: Nilsson
Subject: (Response to message)
To: John McCarthy <JMC at SU-AI
cc: NILSSON
In response to your message sent 2 Nov 1978 0927-PST
Next Wed. at 1:30 is fine. --Nils
-------
-------
∂02-Nov-78 1552 LES Megastore memory
To: TED, BH, JBR, JMC
Ampex now claims that they will deliver the big memory in "mid-December".
∂02-Nov-78 2109 SMG Hoover Institution
Since this afternoon I have thought a bit about why it is that
I feel connection of the Hoover Institution to Stanford in not good.
From time to time I have seen op-ed page editorials in the New York
Times by staff people at Hoover. The one I remember most clearly
was about unemployment. It argued that unemployment was not really
such a bad thing, and that economic policies that raised the unemployment
rate would not really cause suffering. After all, unemployment gives
people more leisure. And many people have boring jobs. And having
a lot of unemployment increases efficiency. Basically I felt that
this article was simply espousing an unidsguised politics of
selfishness, a totally irresponsible approach to social problems.
It is not so much that I disagreed with their politics, as that
the writers at Hoover seemed to be totally unconcerned about social
problems, presumably so long as they had their own jobs. Another
editorial which I remember less well attacked the idea of national
health insurance with extremely simplistic free enterprise arguments
and again a total unconcern for the plight of individuals.
Obviously I have no disagreement with anyone's right to print such views,
but it seems to me terribly unfortunate that as a result of public attention
sought by people at Hoover, Stanford University has become known as a
leading center intellectual justifications of selfishness. The writings
from Hoover differ from some more responsible conservative thinkers,
who argue that conservative policies would bring about an increase in
the general welfare. At times, people at Hoover seem to be saying,
the general welfare simply doesnt matter. Not only does Stanford lend
its prestige to such writings. The image of Stanford in general becomes
associated with reactionary points of view. In an interview in the Times,
the director of Hoover quite openly said that the Institute was building
up staff to have political influence in the next Republican administration.
It is also my perception (perhaps false) that Stanford has intentionally
fostered a center for conservative thought as a way of drawing more
attention to itself, enhancing its general prestige as a way of
ultimately improving its financial condition. There is among the
conservatives a sort of market thinking about the intellectual world.
It would be too hard to compete with schools in the east as a center
for liberal thought, so why not corner the market in conservative thought?
Hoover also does have a predominant effect of the outside view of Stanford
because of its very famous people. Influential liberals have a very strong
incentive not to stay on the west coast, because it puts them out of
touch with Washington. But if your party is out of power anyhow, or
if the state of California has a Reagan for governor, its not such a
bad deal to be here.
I think Hoover is a very uncommon sort of institution for a university -
and again I refer not to its politics, but to its expliticly political
mission. Another one i can think of is the conservative center at
Georgetown (i forget its name) - but i cant think of others at
universities.
steve
∂03-Nov-78 0901 FB via SU-TIP new terminals
To: JMC, LES, DEK
One way to make a new terminal acceptable to a number of hard headed people
is to use an actual AI Lab keyboard and program the terminal to do all the
appropriate things with the usual keystrokes. If that approach proved
successful, then Data Disk terminals could be gradually recycled as we built
the appropriate electronics boxes and put old keyboards and monitors on them.
Can you spare a keyboard if you think this is a good idea?
∂03-Nov-78 1131 Nilsson at SRI-KL (Nils Nilsson) Change of time
Date: 3 Nov 1978 1122-PST
From: Nilsson at SRI-KL (Nils Nilsson)
Subject: Change of time
To: JMC at SU-AI
cc: Nilsson
John, Several of the people who wanted to talk with you suddenly
remembered that they have a conflict on Wed. p.m. (David Kaplan's
seminar). Can we reschedule? How about next Thurs. or Friday?
--Nils
-------
How about Thursday at the same time - 1:30?
∂03-Nov-78 1923 Winograd at SUMEX-AIM Meeting on non-monotonic logic
Date: 3 Nov 1978 1506-PST
From: Winograd at SUMEX-AIM
Subject: Meeting on non-monotonic logic
To: clt at SAIL
cc: jmc at SAIL
Jim Davidson tells me that you will be having a workshop
on Nov. 18, with McCarthy, McDermott, Weyrauch, and
possibly others giving presentatins. I would like to
give one as well, on the ways in which "resource-limited
processing" (a la KRL) relates to very similar issues.
Please let me know more of the details.
Thanks, --terry
(p.s., I'm sending this from SUMEX because SAIL is down.
Answer at SAIL or XEROX since I don't check my SUMEX
mail box). --t
-------
∂03-Nov-78 1923 Nilsson at SRI-KL (Nils Nilsson) Meeting
Date: 3 Nov 1978 1452-PST
From: Nilsson at SRI-KL (Nils Nilsson)
Subject: Meeting
To: JMC at SU-AI
cc: Nilsson
Thursday at 1:30 is fine. --Nils
-------
∂03-Nov-78 1924 Jrobinson at SRI-KL (Jane Robinson) Sunday brunch
Date: 3 Nov 1978 1639-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: Sunday brunch
To: jmc at SU-AI
You are invited to Sunday brunch at 10 am, my house. Just me and my
daughter Anne, bacon, eggs, etc.
If you come, we might look over a sketch I have for scheduling music,
and speakers for the memorial service. I have a couple
of questions about your preferences.
Spoke to Ursula last night. She's a comforting sort.
Jane
-------
Sunday at 10am it is. Thanks very much.
∂04-Nov-78 1737 LPL via SU-TIP labels
All I want to do is create a file of addresses, center them 3 on a line,
then print the page on the XGP, and Xerox that printed page onto my own
gummed labels. I don't see where that requires Chowning's permission...
Your connection with the Lab is through the music group which is
already a larger user than their support to the Lab warrants.
It isn't just his permission that is required. He must use some of his
credit.
∂04-Nov-78 1738 Wiederhold at SUMEX-AIM Progress report
To: S1 at SU-AI
Date: 4 Nov 1978 1733-PST
From: Wiederhold at SUMEX-AIM
Subject: Progress report
To: s1 at SAIL
cc: pickering
S1 meeting report Nov 7 1978 Serra House 1:15
Present FC, BTH, ALL, GIO, HAD, PLZ, ARK, DN, ALS, PN
General
SAIL is super flakey, due to hardware.
Disk channel is still buggy.
A number of tasks are being substantially slowed down.
Loader(ARK)
Coding is complete and testing is in final stages.
Implementation document is to be done.
Its size is now 4000-5000 lines.
Manual (BTH)
About 50-60% of corrections are in. FASM and Opcodes are in. BLH
is working on a formal description of the formal description.
No executive privilege instructions are detailed.
In a week copies of a complete draft will be made available.
It will have examples of how to (correctly) use the instructions
by MLB.
FORTRAN (FC)
Documentation draft and listing will be copied by Jayne. Around
December 1 a formal release can take place. Additions are now of
lower priority than testing.
PASCAL/SOPA (PEG)
Set changes have been delayed by SAIL problems.
Super SOPA is to be created:
1) W5.2(LCW) + (PTZ Z2 = W5.1 + Opt.) -> Z3
2) Z3 + (EJG W4 + Opt. Cond. Comp.) -> E1
3) E1 + (PEG G2 = W5.0 + Char. sets) -> G3
4) fixes for Mark I architecture by LCW(?) -> W6.
To be done:
PC PASC better error message.
PC PASC constant expressions.
PC PASC multiple sizes (integer range, real precision)
ALS - will look at making a language proposal
PASCAL Users GUIDE.
Bit Based Addressing (HAD)
Looks okay in PASCAL, address conversions are well localized. Okay
for integers and booleans. Not worth for reals. Packed fields will
be more expensive to access, and will be useful only in particular
situations.
Required changes to Pcode would be mainly additive. Dividing/
multiplying by 9 seems to be more straightforward than a segmented
address. Can subranges be -1 to 1 Talk to RLS.
New type for unsigned fields? They seem important for many system
functions. A proposal is due for unsigned/signed bytes. An
implementation question is whether to delay field extension
as SOPA does now, or to load the fields as they are encountered.
PASMAC (ALL)
Macro language discussion has gone on, see PASMAC.LOG[DOC,s1].
In order to make progress
1. define the objective of PASMAC.
To be resolved on that basis: preprocessor vs. in compiler.
Questions: should MACROS globals be redefinable.
Remedy PASCAL deficiencies:
1) array sizes: adjustable now with constant dynamically variable
cannot be done anyway.
2) array size: specific procedure.
Macro can generate multiple adjusted copies.
Have one prototype.
3) Conditinal compilation - system recognition.
4) In-line procedures.
SOPA subgroupmeeting Serra House 2:30 thursday
Attending: ALS, GIO, HAL, PEG, PTZ
Optimization (PTZ)
Completed peepholes
1) Jump to jumps (unconditional) any length within a procedure.
2) Skip-jump -> skip opposite.
3) Collapsing of MOVES when possible into preceeding instruction.
In process
4) Increment + skip or jump collapse; effective in loops with (3)
Merge will be relatively simple since changes are based on a late
version of SOPA.
Work with SOPA is affected by long compile times - more than 11 minutes
CPU time to compile SOPA on SOPA. This is due to its size (11000 lines),
but checking takes time too, but should be kept.
The fetching of fields from words is costly. Using more dataspace
could make SOPA opoerate faster. Initial design affected by 360
specifications. Space is valuable still to some extent.
Change will be difficult , and tradeoff does not
make change essential now.
SOPA (PEG)
Setsize limit is now 144.
Globally setsize can be changed by multiples of 72. Register usage
can be heavy in set-expressions, and this part can hurt when
a) new linkage convention comes up,
b) complex expression occur since SOPA does not allocate expression
temporaries when it runs out of registers, but gives up.
RUNTIME (HAL)
Bug for decimal places in real has to be fixed. KO showed where,
but much cleanup is needed. Curt wants faster access to the filename
via register rather than stack. This improves consistency, but will
not improve running time significantly since input-output operations have to
occurr infrequently in systems that are not completely I/O bound.
A change for SOPA to go to the new linkage conventions is major, and
is not a wise task now, since at the available levels of effort
it will take too long and cause merging conflicts.
-------
∂04-Nov-78 2049 BTH SMA3
To: S1 at SU-AI
If you are interested in receivng a copy of the new architecture
manual please add your name to the file SMA3.LST[DOC,S1]. Please
be sure we have both your name and your arpa net address.
∂04-Nov-78 2054 DCL
To: "@GROUP.DIS[VCG,DCL]" at SU-AI
***********************************************************************
VERIFICATION GROUP SEMINAR
TUESDAY 14TH NOVEMBER
PLACE: ERL 237
TIME: 2:30 p.m.
TITLE: Complete Sets of Rewrite Rules for Abstract Data Types
SPEAKER: David R. Musser
USC Information Sciences Institute
Abstract
A set of rewrite rules is said to be complete if it has both the
finite termination property and the unique termination (Church-Rosser)
property. The equations of an algebraic specification of a data type
often can be formed into a complete set of rewrite rules that can be
used in proving properties of the data type. The equational axioms of
a specification of finite sequences, for example, are easily shown to
form a complete set of rewrite rules. The specification also includes
an induction axiom, expressing the constructability of the values of
the type. If one adds a rule corresponding to a property whose proof
requires induction (e.g. the associativity of concatenation), unique
termination may be destroyed, but often can be restored by using the
Knuth-Bendix algorithm to generate additional rules. The application
of this and related techniques to proving data type properties will be
discussed. (These techniques have been implemented in an experimental
program verification system at ISI.)
NOTE: NO SEMINAR ON NOV. 7th.
∂05-Nov-78 1413 RAJ.REDDY(A610RR29) at CMU-10B
Date: 5 Nov 1978 1714-EST
From: RAJ.REDDY(A610RR29) at CMU-10B
Subject:
To: JMC at SU-AI
Dear John,
We were shocked and distressed to hear about Vera's untimely death
in the Himalayas. My thoughts have been with you and about
you ever since we heard this news. Our heart felt sympathies
to you and Vera's family.
Sincerely,
Raj
∂06-Nov-78 1042 CLT
Regarding Terry Winograds request to give a talk at the nonmonotonic meeting---
Do you have any objections? If not, I will include him. ___Carolyn___
Please include him.
∂06-Nov-78 1037 HVA Letters
Good Morning, John (if you are logging in at home). Last week, you mentioned
sending letters re the Memorial Service for Vera and I simply wanted to re-
affirm my desire to see that the mailing is accomplished according to your
wishes.
∂06-Nov-78 1327 RWW
I am having a potluck dinner at my house this Saturday evening NOV 11
at 7:00. If you are interested in coming, please let me know how many of
you and what you would like to bring. As yet I do not know the size of
the crowd. As usual please feel free to bring along anyone you would like.
There is an online map in MAP[S,RWW]@SU-AI
If it's ok, I would like to make a last minute decision on your potluck.
∂06-Nov-78 1401 RWW
∂06-Nov-78 1358 JMC
If it's ok, I would like to make a last minute decision on your potluck.
sure. as you know they are completely informal.
∂06-Nov-78 1409 Ijcai79 at SUMEX-AIM IJCAI-79
Date: 6 Nov 1978 1410-PST
From: Ijcai79 at SUMEX-AIM
Subject: IJCAI-79
To: Bruce at BBN-TENEXD, Burton at BBN-TENEXD,
To: CROCKER at USC-ISIB, JWF at LL-11, LH at MIT-ML, LENAT,
To: DCL at SU-AI, MCCARTHY at SU-AI, MINSKY at MIT-AI,
To: JM at MIT-MC, Nii, Nilsson at SRI-KL, Pratt at MIT-AI,
To: Price at USC-ECL, Reddy at CMU-10B, Rosen at SRI-KL,
To: ALS at SU-AI, Schank at USC-ISI, GJS at MIT-AI,
To: Taylor at PARC-MAXC, Teitelman at PARC-MAXC, TW at SU-AI,
To: falk at BBN-TENEXE, !Goldstein at PARC-MAXC,
To: Kaplan at PARC-MAXC, Raphael at SRI-KL,
To: Robertson at ARPA-DMS, Weizenbaum at MIT-AI,
To: Woodham at MIT-AI
cc: Buchanan, ijcai79
REMINDER:
We are awaiting your reply indicating whether or not
you will be able to serve as a referee for IJCAI-79.
Please complete and return the inquiry form. If you
have not received the form or need another copy,
sndmsg <ijcai79@sumex-aim>. Thank you.
Bruce G. Buchanan
Chairman, Program Committee
Return forms to:
Prof. Bruce G. Buchanan
IJCAI-79
Computer Science Dept.
Stanford University
Stanford, CA 94305
-------
∂06-Nov-78 1415 JMC
.mail rivest%ai
Subject: slight bug in your encoding scheme
Type message followed by <CONTROL><META><LF>
I don't have your paper with me, but as I recall it, there is the following
slight bug. If the enemy can guess the exact contents of a block,
he can confirm his guess. In military and commercial text, exact
repetitions of substantial pieces of text are common, and long guessable
sequences that fill the blanks in standard text exist. Much can be learned
by the confirmation of such guesses, and a computer program can check
guesses rapidly including sliding the text relative to the block
boundary. The fix is to include enough genuinely random or well-made
pseudo-random text in each block, so that the block cannot be guessed.
I had been intending to mention this for some time after checking to
be sure that you didn't mention the problem, but I didn't get around
to checking. Sorry if it's old hat.
∂06-Nov-78 2223 JB ORALS.
I wuld like to schedule the orals this quarter. Some time between Dec. 3
and Dec. 8 would be best. The last date is Dec. 8 for this quarter, and
scheduling must be done 3 weeks in advance. What schedule would you suggest?
TAK FUNCTION: the TAK function proved to be a good example for GOL.
I proved it using exactly your axioms. GOL did not proved it automatically,
but it proved useful as an aid to structure the proof exactly along the
lines suggested in your paper "An Interesting LISP Function".
The proof took: 1 command to create the goal, 9 TRY commands and 5 MONADIC
commands. That was all I think. I used a new small strategy tailored for this
purpose of case analysis.
∂07-Nov-78 1051 CH
A REMINDER THAT THERE IS A FACULTY MEETING TODAY AT 2:30. TODAY BEING TUESDAY
NOV. 7.
∂07-Nov-78 1051 CET Textbook for Winter Quarter CS258
John, do you plan to use a textbook for CS258 Winter Quarter
or classnotes? If a text, we should order immediately. If notes,
the closer to December 1 that they go to press, the better our chances
of having them by Jan.
Carolyn
∂07-Nov-78 1120 PHW at MIT-AI (Patrick H. Winston)
Date: 7 NOV 1978 1419-EST
From: PHW at MIT-AI (Patrick H. Winston)
To: jmc at SU-AI
Some Yugoslavs asked me to organize an AI seminar
in Yugoslavia just before the AI conference. It is
mostly to be slanted at Robotics, but they hope to
get some general ai people, namely Davis, Sussman,
Hart, Winograd, Newell, Feigenbaum, and me, as well
as others to be added as first choices decline. Nils
tells me that you are organizing a far east seminar that may
seriously conflict, attracting many of these same people.
Can you tell me
1. The probability or your thing happening.
2. Whom among the above you will ask.
Thanks,
Patrick
The probability of my thing happening is close to zero. It depended
on the Japanese, and they appear to have done nothing.
∂07-Nov-78 1207 Feigenbaum at SUMEX-AIM Personal/confidential
Date: 7 Nov 1978 1208-PST
From: Feigenbaum at SUMEX-AIM
Subject: Personal/confidential
To: jmc at SAIL
John,
This morning I called Don Rosenheim, head of IBM Research,San Jose,
and proposed that IBM establish an annual fellowship at Stanford
in our department for women in computer science in Vera's name.
We'll hear soon.
Ed
-------
∂07-Nov-78 1450 CH chinese delegation visiting Stanford
DOUG MURRAY (OF US-CHINA RELATIONS PROGRAM) CALLED THIS AFTERNOON TO INFORM YOU
THAT THERE IS A DELEGATION FROM CHINA--LED BY THE SEC GEN OF THE CHINESE ACADEMY
OF SCIENCES. HE WAS UNSURE WHETHER YOU WOULD BE INTERESTED IN PARTICIPATING IN
THE VISITING GROUP CONSIDERING YOUR PRESENT SITUATION BUT HE WANTED TO LET YOU
HAVE THE FOLLOWING INFORMATION SO THAT YOU COULD DECIDE WHAT COURSE OF ACTION IF
ANY YOU WANTED TO TAKE .
THERE WILL BE A DINNER FOR THE DELEGATION THIS EVENING (11-7) AT THE CHINA
FIRST RESTAURAND (EL CAMINO NEXT TO THE HOLIDAY INN) AT 7 PM. IF YOU WOULD LIKE
TO ATTEND DOUG NEEDS TO HAVE YOUR ANSWER BY 5 PM TODAY.
ONE MEMBER OF THE DELEGATION IS MISS HU CHI HENG WHO ATTENDED ONE OR BOTH OF YOUR
LECTURES YOU DELIVERED IN PEKING. SHE IS THE DEPUTY LAB HEAD OF THE INSTITUTE
OF AUTOMATION. SHE IS INTERESTED IN SEEING SOMETHING OF THE A.I. LAB ANYTIME
ON THURSDAY OF THIS WEEK.
PLEASE CONTACT DOUG AND LET HIM KNOW YOUR FEELINGS WITH REGARD TO THIS MATTER.
∂07-Nov-78 1643 RIVEST at MIT-ML (Ronald L. Rivest)
Date: 7 NOV 1978 1938-EST
From: RIVEST at MIT-ML (Ronald L. Rivest)
To: JMC at SU-AI
Dear John,
Thanks for your letter about our encryption scheme. The problem
you mention is well known, but often overlooked by people who are
designing a system incorporating encryption for the first time. Besides
the solution you propose (of incorporating random text in each block),
the following method also works: When encrypting a message which has
been broken into a sequence of blocks M1, M2, ..., Mn, first transmit
a random block C0. Then for each block Mi transmit as its ciphertext
Ci the encryption of (Mi XOR C(i-1)) . Thus no ciphertext is the
encryption of any sensible looking text, although it is easy to decode
this. The only overhead is the initial transmission of the first block
of random stuff. The error-propagation properties are also good, since
if Ci is garbled in transit then only Mi and M(i+1) are lost.
I heard that your wife was recently killed while mountain-climbing.
You have my sincere sympathy and condolences.
Ron Rivest
∂07-Nov-78 1652 JB TAK FUNCTION.
The complete proof I did is in the file TAKFU.PRO[GOL,JB].
The strategy IFCASESHORT is the one I deviced for this purpose;
it is called by specifying a wff; it first splits the goal into
two cases: wff⊃goal, and ¬wff⊃goal. Then it does two "⊃I" subgoalings
on both subgoals, then a rewrite on each.
∂08-Nov-78 1359 Nilsson at SRI-KL ( Lunch?
Date: 8 Nov 1978 1357-PST
From: Nilsson at SRI-KL (
To: JMC at SU-AI
cc: Nilsson
John, Are you free for lunch tomorrow prior to our discussions in the
afternoon. If so, we could try our SRI buffet again unless you'd
prefer another place. --Nils
-------
I can meet you for lunch at 12:30 at SRI if that's ok. -- John
∂08-Nov-78 1448 CCH
Please call Mary McGovern at 7-3264. thank you
∂08-Nov-78 2325 SSO Modal Logic Seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
Modal Logic Seminar
Thursday, October 9
2:45
Liveness Specifications for Synchronizers
Susan Owicki
Abstract
I will discuss the use of modal logic to specify conditions under which a
synchronization operation (such as a semaphore wait) must terminate. We
can distinguish at least five degrees of strictness in these termination
conditions, inclluding unfair, fair, and FIFO. Four of the above can be
expressed in our modal logic; the fifth (bounded fairness) presents some
difficulties.
∂09-Nov-78 0246 MRC Dialnet performance
To: LES, JMC
The performance statistics I have from SAIL to SAIL on a connected
but idle line (the normal state of the kludge ports) show that
framing errors are occuring on a supposedly perfect connection. The
next system will tell me how bad the problem really is, since a good
deal of framing errors are not counted due to an oversight in my
original statistics gatherer.
Needless to say, though, the fact that this IS occuring is upsetting.
I'm investigating further.
∂09-Nov-78 0849 JLH LOTS
To: JMC
CC: JLH
I have considered the possibility of being LOTS director next year.
In light of the influx of new computer systems and research projects,
which I have committed myself to, I feel I do not have the
time to act as director.
John.
∂09-Nov-78 1105 Scott at PARC-MAXC Reminder
Date: 9 Nov 1978 11:03 am (Thursday)
From: Scott at PARC-MAXC
Subject: Reminder
To: JMC @ SAIL
cc: Scott
John:
I enjoyed our conversation yesterday and hope to get together soon again.
Please remember to give me a copy of the thesis of R.S. Cartwright. I am trying to
collect together all the theoretical papers on LISP. I'll make a list of what I got
soon and would then appreciate suggestions.
Yours, Dana
∂09-Nov-78 1110 CH
fran Allen called to let you know she would be arriving at 12:07 (midnite)
on American Airlines flight #15 tomorrow at SF Airport.
∂09-Nov-78 1116 Nilsson at SRI-KL (Nils Nilsson) Lunch at 12:30 ok
Date: 9 Nov 1978 1105-PST
From: Nilsson at SRI-KL (Nils Nilsson)
Subject: Lunch at 12:30 ok
To: JMC at SU-AI
cc: Nilsson
-------
∂09-Nov-78 1414 DRB via MIT-MC patte
To: LES, HVA, JC, JMC, MUZ
She wanted me to tell you she will be getting back next Tuesday
afternoon, after a relaxing stay in sunny Branford.
∂09-Nov-78 1513 Ijcai79 at SUMEX-AIM MEETING AT 3:00
Date: 9 Nov 1978 1505-PST
From: Ijcai79 at SUMEX-AIM
Subject: MEETING AT 3:00
To: JMC at SAIL
REMINDER: Meeting at 3:00 in Cedar Hall with Dr. Hu!!!!!!
-------
∂09-Nov-78 1615 Jrobinson at SRI-KL (Jane Robinson) Memorial service
Date: 9 Nov 1978 1615-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: Memorial service
To: jmc at SU-AI
cc: clt at SU-AI, jrobinson
John,
Here is a draft of the program for the memorial service. We aren't sure yet
who the minister will be or even if we have one. Also, Irene has not arrived
and confirmed whether she will speak. Finally, we don't have the exact
date of Vera's birth. I thought it would be good to have the dates, and
if you agree, could you supply that one? And let us know of any changes
whatsoever that you would like. Caroline Talcott and Bob -??- are in charge
of reproducing the final form.
Jane
-------
∂09-Nov-78 1642 Jrobinson at SRI-KL (Jane Robinson) I forgot
Date: 9 Nov 1978 1642-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: I forgot
To: jmc at SU-AI
to include the copy of the program. Here it is:
VERA WATSON MCCARTHY
Month day, 1932 Dairen, Manchuria - October 17, 1978 Annapurna, Nepal
Memorial Service
Stanford Memorial Church
November 12, 1978
Organ Prelude
Prayer
Personal Remembrances Irene Miller
Michael Blasgen
Organ Interlude
Personal Remebrances Ursula Maydell
Frances Allen
Benediction
Organ Postlude and Recessional
Minister : Name
Organist : Pamela Decker
(Reception follows at Bechtel International Center)
Jane
-------
∂09-Nov-78 2132 JMC Ruth Kirk called
To: JMC, WD
Ruth Kirk (next door neighbor) called. She had just heard that
the service was to be on Sunday and offered the use of a room in her house
for any guests you may have coming. Her number in Princeton is:
(609)924-8537. He daughter goes to nursing school at Stanford and
lives in Cupertino. Her numbers are: 497-4865 and (408)255-3665.
Ruth Kirk sends her love.
Whit
∂10-Nov-78 0704 FB keyboards
To: LES, JMC
Microswitch is making more Stanford AI keyboards so I will get a few of those.
I have a Motorola high resolution monitor now. It certainly is nice, especially
for $550.
∂10-Nov-78 0743 REM via AMES-TIP IC2 results!
To: JIRAK at SUMEX-AIM, WILCOX at SUMEX-AIM, REM at SU-AI,
WILBER at SRI-KL, JMC at SU-AI
I collected a transcript of a MAINSAIL program with trace of GC and
SWAP and MEMORY-MAP enabled to help JIRAK%SUMEX locate a bug. The
transcript was 42367 words long. After crunching with the adaptive
one-pass algorithm (IC2), it became 3443 words long, for a compression
ratio of 12.3 to one!!!! This shows how nice it is. A person could
have written a special-purpose data-compressor that did slightly better,
at the expense of several months programming and debugging, but in just
a couple minutes my program adapted itself to the new file and crunched
it tremendously. There are many cases where a system designer is afraid
of generating verbose pretty redundant reports (in the RPG/COBOL sense)
because they will occupy lots of disk space. But there is essentially
no penalty for readable pretty grossly-redundant reports if data-compression
is available to squeeze out almost all the redundancy without losing
information and to decompress whenever a listing of the report is needed.
I am in favor of verbose readable reports and the data-compession that
makes them feasible.
∂10-Nov-78 1002 Jrobinson at SRI-KL (Jane Robinson) Program
Date: 10 Nov 1978 1002-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: Program
To: clt at SU-AI
cc: jmc at SU-AI
Irene Miller has accepted. The date of Vera's birth, according to
Frances Allen-who should know-is February 15, 1932. The minister
is The Reverend Wendy Smith. She sounds just right for the occasion.
Jane
-------
∂10-Nov-78 1040 HVA Stanford DAILY - Fri. ll/10/78
The DAILY has just arrived (w/I.D.Mail), and I've put a copy in your box - to
read or not to read. There is a front page article (A.P. release),on yesterday's
interview w/ A.Blum & I. Miller; Sunday's Service for Vera is also announced.
∂10-Nov-78 1112 HVA CORKY C'S Thesis - AIM 296
I mailed thesis to Prof. Dana Scott, XEROX Parc, this a.m.
∂10-Nov-78 1257 JB Orals data.
Did you receive my message about the file TAKFU.PRO[GOL,jB] ?
Did you decide about a data ffor the orals?
The file you mentioned doesn't seem to exist. Any date that doesn't
conflict with my other commitments is ok.
∂10-Nov-78 1327 ARK S-1 Meeting
To: S1 at SU-AI
There will be a meeting of the S-1 Project staff on Wednesday, November 15
at 1:15 p.m. in the Serra Conference Room.
Arthur
∂10-Nov-78 1352 TOB POLISH VISITORS
John
I received a letter from someone in Dept of Labor
who had a phone conversation with you about the
visit of two Poles for two weeks. They come
to study microprocessor systems for control
of manufacturing. Did you agree to their coming?
They seem to have some connection with robots,
so perhaps the fit is ok. We aren't doing much
with microprocessors now, just waiting until we
can use them without software hassles.
What will we get out of it?
Tom
∂10-Nov-78 1357 JB TAKFU.PRO[GOL,JB].
THE file TAKFU.PRO[GOL,JB] does exist. May be you tried the wrong area?
∂10-Nov-78 1415 HVA AIRLINE TICKETS
CC: JMC, JW, HVA
John - your tickets have been delivered, and I have put them in the safe -
I certainly expect to be here Monday but Jeanette knows where they are,too.
∂10-Nov-78 1538 Jrobinson at SRI-KL (Jane Robinson) Saturday brunch
Date: 10 Nov 1978 1538-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: Saturday brunch
To: jmc at SU-AI
My house at 11 am. Daughters welcome. Expecting you, Ursula, Fran.
Jane
-------
We'll be there.
∂10-Nov-78 2025 BTH
To: S1 at SU-AI, "#MANUAL.LOG[DOC,S1]" at SU-AI,
"#S1ARCH.MSG[DOC,S1]" at SU-AI
A new directory has been created, [SMA,S1] containing the files
concerning the new architecture manual. Check INDEX[DOC,S1] to
see which files have been moved from DOC to SMA. In particular,
the distribution list for the new manual is now in SMA3.LST[SMA,S1].
∂11-Nov-78 1710 JBR
∂11-Nov-78 1709 JMC
To: JBR at SU-AI, MRC at SU-AI
MRC and I doing WHO were getting 40 percent of the machine. Why?
Because WHO lies about percentages, especially for programs that are
synchronized to the clock.
∂11-Nov-78 1715 MRC
∂11-Nov-78 1709 JMC
To: JBR at SU-AI, MRC at SU-AI
MRC and I doing WHO were getting 40 percent of the machine. Why?
mrc - Livermore lines were losing.
∂11-Nov-78 2241 DCO
I regret that I shant be able to be at the memorial service for
Vera. I just returned home from surgery on my knee and wont be mobile
for a few more days at least. I'm sorry.
∂12-Nov-78 1900 LLW Vera
To: JMC
CC: LLW
John, your remark to me this afternoon at Vera's memorial service impels
me to note that to only a relative handful of humans is it given to probe
the limits of human existence, and most of them shrink back from doing so.
The most gifted of those that exert maximally are able to make memorable
works of art of their lifes at these limits, thereby often going early to
the fate that ultimately claims us all. A highly fortunate fraction of
these go to this fate from the company of friends, while engaged in doing
that which they love best. It thus seems to me that Vera lived and died
as splendidly as humans are allowed. I hope that you might be somewhat
comforted by such reflections (which I have mused over following the
extremely painful loss of two very close friends in high-performance
vehicle accidents during the last several years). Lowell
∂12-Nov-78 2113 MRC Dialnet performance
To: JMC, LES, BH
The new system I brought up today (with improved performance statistics)
claims that all lost (ie, not received) packets processed so far are due
to framing errors.
∂12-Nov-78 2117 WD
To: JMC, WD
I ended up with the guest book from the service. I have slipped
it under the door to your office.
Whit
∂12-Nov-78 2140 ALS
To: S1 at SU-AI
A proposal regarding the QHID and HRD problem
I propose that we resolve the word-length problem in S-1 PASCAL by
adopting a double standard for integers, that is by allowing both a
declaration of precision or range and/or a declaration of word size. If
both range and word size are specified, then the actual word-size used
would be such as to allow for the larger of the two. Range checking, if
used, would still be fixed by a range declaration. If not restricted by
a non-negatve range specification, all integer values would be assumed to
be signed.
Reals would, however, be always specified in terms of the word size.
Allowed TYPES would then include QINT, HINT, INTEGER and DINT for integers
and HEAL, REAL and DEAL for reals.
If you agree with this, nuf said; if you do not, then perhaps you will want
to read the following.
My reasons for favoring this solution are:
1) It is very important for the continued life of the entire S-1
project for the early users to be able to get programs running on the
S-1 with the least possible delay and to make full use of the capabilities
of the S-1.
2) Habitual Assembly-Language programmers should be enticed to use
PASCAL for many if not most of the system programming jobs so that the S-1
can be gotten up to full speed usage as soon as possible. Since system
programs are usually written in assembly language the specification of
word size seems more natural for such tasks.
3) Programs written in S-1 PASCAL will seldom be outward portable
in any case, since they will usually be for problems that are too large or
too time consuming for most other machines. This may not always be true,
GIO says he expects export and import to Cray's and CDC-6600's but the
transport need not be entirely pain-free. Problems big enough to warrent
transporting to these machines will probably require some special handling
in any case.
4) Programs written in (non S-1) PASCAL will be portable to the S-1.
One might want to search them for their use of the names we have assigned
as new types and replace these names to avoid confusion and one might want
to add to their declarations but these changes would be simple to make.
5) Simple programs can still be written simply and programmers who
do not want to bother with word size decisions can still adhere to their
old habits.
6) Some users will find one method more suited to their needs and
some will prefer the other, and indeed in some programs it may be
convenient to define some VARs in one way and some in the other. For
example, if one requires something greater than 18-bit precision for an
integer but if 32-bit precision is quite adequate, then one might choose
to specify full-word precision (by default) so that the program would be
portable to 32-bit machines. On the other hand, if one needs the full
36-bit precision one could specify the range and not the word length,
in which case the program would only be portable to 32-bit systems if they
recognized our conventions and supported words longer than 32 bits.
7) Purists are apt to object to this cluttering-up of the language
but S-1 PASCAL is not a teaching language but a utility to exploit the
full capabilities of the S-1, so let's get on with the job.
∂12-Nov-78 2347 ZM Richard Lee - lunch
Let's meet at 12:00 in Polya Hall.
∂13-Nov-78 0720 REM via SU-TIP MORE IC2 RESULS
CC: WILCOX at SUMEX-AIM, REM at SU-AI, JMC at SU-AI
Another crunch of mainsail transcript with swap,map,collect enabled:
Original 3488 words, crunched 598 words, c.r. 5.8 to 1. Note, because
the file is small, the c.r. wasn't as good as with the 40k file crunched
a couple days ago, but still it was nearly six to one! With highly
redundant data, it does great.
∂13-Nov-78 1147 REM at SU-AI at MIT-AI
Date: 13 NOV 1978 1416-EST
From: REM at SU-AI at MIT-AI
Sent-by: ←←←016 at MIT-AI
To: RWW at SU-AI
CC: jmc at SU-AI, rem at SU-AI, wilber at SRI-KL
I called the stanford technology licensing office today.~
They have done nothing since we last contacted over a month ago,
not even contacting companies. The person I met with is still
waiting to meet with the other person in their office before proceding.
I get the idea if left to themselves it'll take forever, so I think
we should ignore them and go ahead by ourselves, without patent but
getting written agreements from everyone involved that the original
patent for the overall idea belongs to me and individual patents
for devices we develop together or which they develop by themselves
based on my idea belong to half-me half-them. We'll have to work out
some reasonable arrangement for giving you a good share of each
particular application we market together.
Do you have any interested companies in mind for immediate contracting?
I might be up at the lab later this afternoon, making listings until
system goes down at 1700 then being available for offline talk.
∂13-Nov-78 1631 BTH
To: S1 at SU-AI
ALS's "A proposal regarding the QHID and HRD problem"
I wish to caution implementers of ALS's proposal to remember PASCAL's
philosphy against type coercision. That may imply that there will have
to be an explicit type conversion function for every pair of integer
types. I would hate to see more of the SAIL type coercision philosophy
forced on PASCAL (as is already done with mixed mode arithmetic).
∂14-Nov-78 0847 Tajnai at SUMEX-AIM MTC Qual
Date: 14 Nov 1978 0847-PST
From: Tajnai at SUMEX-AIM
Subject: MTC Qual
To: JMC at SAIL, PAT at SAIL
cc: dpb at SAIL
John, do you plan to give the MTC Qual in December?
If so, we need to set the date and post notices and
sign up sheets.
Carolyn
-------
∂14-Nov-78 0928 JLH via SU-TIP Pascal types and the S1
To: S1 at SU-AI
Reply to various proposals for the S1 type structure using Pascal
1. Portability is important !!!
2. Adding predefined types such as half, quarter and double word is o.k.
Programs can retain reasonable portability by redefining these
types as all full word. The real question is defining arithmetic
operators, etc. to work on these.
3. The LAST thing we want is SUPER coercion, ala SAIL. To avoid this a number
of explicit coercion routines are needed.
The short and long words can be treated as subranges adding the
possibility of their own arithmetic structure (I am not sure how
to do this).
4. Separating out size and range is a bad idea, it adds FAR too much
complexity - for good examples see PL/I and the BLUE language
proposal. A neat merging of concepts is needed.
∂14-Nov-78 1058 DPB Colloquium scheduling as of Nov 14, 78
To: "@FAC.DIS[1,DPB]" at SU-AI, "#CSD.BBD[INF,CSD]" at SU-AI
Colloquium schedule for Fall Quarter is complete. For Winter Quarter,
we have two January and two February dates (and a few later dates) covered.
Hottest open date right now is January 9, the first Tuesday of the quarter.
All speakers who have been suggested to me have been pursued (and many are
signed up for later.) We need a volunteer or a solid contact for the
January 9 date, SOON. Also, general suggestions for later on are welcome.
∂14-Nov-78 1653 MRC
You are exceeding your disk quota.
Files that occupy space beyond your quota are subject to purging!
If you don't delete some of your files, the purger will.
Your disk quota is: 2000
Your files occupy 2295
∂14-Nov-78 1658 CLT
To: "@NON.DIS[1,CLT]" at SU-AI
UPDATE
Non-monotonic Logic in 4 Flavors
A mini-conference on non-monotonic logic
Date: Saturday 18th November, 1978
Time: 10am to 5pm (or thereabouts)
Place: Faculty lounge,
3rd floor of the Mathematics Building
Stanford University
The order of speakers and approximate titles will be:
John McCarthy Circumscription Induction - A Way of Jumping to Conclusions
Drew McDermott Non-monotonic Logic
Terry Winograd Extended Inference Modes in Reasoning by Computer Systems
Richard Weyhrauch Metamathematical Explanation of Non-monotonic Reasoning
Each speaker will be alloted an hour to be used for presentation and answering of
questions(the proportion of time spent on each being up to the speaker). There will
be a lunch break after the second talk, and open discussion after the last talk
until ???
Coffee and donuts will be served from 9:45 as people are gathering.
As usual pass the word to anyone you think might be interested. Questions to
Carolyn Talcott [CLT at SU-AI] 497-4971.
There will probably be a group going to Louies (Chinese food) after the meeting. If
you would like to come along send a message to Carolyn immediately so reservations
and menu plans can be made.
∂14-Nov-78 1717 MRC
To: S1 at SU-AI
You are exceeding your disk quota.
Files that occupy space beyond your quota are subject to purging!
If you don't delete some of your files, the purger will.
Your disk quota is: 7000
Your files occupy 8935
∂14-Nov-78 1952 MRC
To: S1 at SU-AI
∂14-Nov-78 1828 Feinler at SRI-KL (Jake Feinler) PASCAL News
Date: 14 Nov 1978 1652-PST
From: Feinler at SRI-KL (Jake Feinler)
Subject: PASCAL News
To: [SRI-KL]<NETINFO>LIAISON-10-78:
14-Nov-78 15:41:05-PST,1181;000000000001
Mail from SRI-KL rcvd at 14-Nov-78 1541-PST
Mail from NBS-10 rcvd at 14-Nov-78 1537-PST
Date: 14 Nov 1978 (Tuesday) 1838-Est
From: JWALKER at NBS-10
Subject: Please forward
To: jake at SRI-KL
cc: JWALKER
Jake,
Please forward this note to all liasons.
Thanx.
J.
ENCL:
From ANSI news release X3/78-130, dated Nov. 10, 1978:
ANSI has formed an X3 Technical Committee on the Programming Language
PASCAL. The committee, known as X3J9, will hold its first meeting on
Tuesday, Dec. 19, 1979, at:
CBEMA Offices
Suite 1200
1828 L St., N. W.
Washington, D.C.
CBEMA (Computer and Business Machine Equipment Manufacturers Association)
serves as Secretariat to the X3 parent committee of X3J9.
We are seeking active participation from users of PASCAL as well as
developers of compilers for the language. The initial task is to
prepare a proposal for standardization of the language and obtain
approval, from ANSI, of the proposal and program of work.
Interested persons/organizations should contact
C. A. Kachurik
Secretariat Staff
(202-)466-2288
or
Justin C. Walker
JWALKER@NBS-10/JWALKER@NBS-UNIX
for details.
-------
∂14-Nov-78 2343 WD
To: JMC, WD
I think the problem you described to me about federal employees
using home terminals may be solvable as follows. I believe there are
trades (auto mechanic for example) in which it is customary for the
tradesman to own his own tools, and I suspect the custom is followed
even in government employ. Perhaps it could become customary for
programmers to own their own terminals.
∂15-Nov-78 0345 MRC Biz Skool
Well, now I have a NEW excuse for not getting anything done there:
they are suffering hardware lossage. I came in, found it dead, and
spent a frustrating hour before concluding that it was hardware and
gave up. I left a note for them telling them what happened. Sigh.
∂15-Nov-78 1108 CH
THE LOGIC SEARCH COMMITTEE MEETING WILL BE TUES. NOV. 21 AT 11 AM IN VENTURA
HALL, SEMINAR ROOM.
∂15-Nov-78 1356 DCL user load
To: LES, JMC
As you know, we are currently running with load averages varying from 10 to 20
not only during the afternoons, but also in the evenings up to midnight, and
on Sunday afternoons.
There is no way to run a job requiring any CPU cycles under these conditions.
We must squeeze the user community.
At 1300 hrs. today, a spot check revealed the following numbers of users:
music-6, cs-5, h-5, fr-4,pv-4, guests-2, s1-2.
music had the compute bound jobs, and were running 10 jobs, CS consisted
of 4 students and DEK.
I suspect that S1 comes more into play in the evenings.
Lessons: 1 cs students and guests are nontrivial.
2 A squeeze on people unaffilated with a Lab. project would help
the situation, but only if there is simultaneously a squeeze on
the large projects, music and S1. Otherwise, they will hog the slack.
LES tells me the music project currently has 33 users.
Also, I see MUZ has the system downtime today; thats two hours dedicated use.
Well, I would like a few new users - such as Prof. Dahl - but I am at a loss
to suggest when he might try to use the verifier.
I think we really do have to start portioning out our resources strictly.
∂15-Nov-78 1653 DEW
What was the name of that MIT student you had me talk to in your office
a few months ago? Thanks, Dave
∂15-Nov-78 1948 REF phone message from Sarah
Sarah called. She's worried about paying next quarter's fees. She
requests either a call from you, or some money ($229.50.).
bob
∂16-Nov-78 0904 Wiederhold at SUMEX-AIM A map in symbolic notation
Date: 16 Nov 1978 0904-PST
From: Wiederhold at SUMEX-AIM
Subject: A map in symbolic notation
To: jmc at SAIL
MAP to 155 Marine Road, Woodside(+), {Wiederhold,851-8363}
north
Red Roofed [] d >>>>>>>>>>>>
House 1
. Half Moon Bay
*dcdcdcdcdc H
c C
gcgcgd }
gd 2
{Ridge Road}c 9
g {County Road} {
gcgc.5gcg H
c c C
g g H
HCHC{35}HCHCHCHCHC*HC1HC*HCH{35}HCHC*HC{Skyline Drive}HCH7HCHCH*
R H
R C C
C 5{Kings Mountain Road} 5
{ R H
84}RCRCRRC C C
RR H
* C
R R{Woodside} H
R R H
R 2 HHHHHHHHH
R R H H
FFFFFFFFF*FF2FF*FFFFFFF{280}FF{Junipero Serra}FF{280}FFFF*FFFFFFFFFFF*F25FF*
R R H R {SF}
R } } R
{SandhillR 4 2 {Bunker
Road}R 8 9 Hill}
R { {
R R H
{Stanford} {San Mateo}
!Legend
{Designation} [goal] *mileage* lower case-one lane, else more.
F(reeway) C(urvy) H(ighway) R(oad) G(ravel) D(irt)
Have fun!
-------
∂16-Nov-78 1014 PAT message from Egon regarding Ershov
He called and left the following message:
He checked with the state department and the reason Ershov is not
coming to the west coast is simply due to the fact that his visit has been
shortened from 6 weeks to 4 weeks and it was felt that there was not enough
time for him to finish his project in New York and visit the west coast.
There is no retaliation or political reasons for his not coming to the west
coast.
∂16-Nov-78 1326 TOB
∂13-Nov-78 1550 Wilcox at SUMEX-AIM MAINSAIL
Date: 13 Nov 1978 1550-PST
From: Wilcox at SUMEX-AIM
Subject: MAINSAIL
To: tob at SU-AI
The latest version of MAINSAIL is up at the ai-lab. I sorta get the
feeling your project is never going to use MAINSAIL, but if there is
any interest let me know and we'll help out as we can. This latest
version is now up on TENEX, TOPS-20, TOPS-10, RT-11 and UNIX. RSX-11
is under development. We'll probably do the VAX or IBM-SERIES/1 next,
but neither of them real soon. We have some bound manuals now, and
I'll send you some if you have some programmer who plan on using
MAINSAIL. Whenever I log in to the ai-lab to play with MAINSAIL, the
response is so bad that I usually give up and log off. I have no idea
how you get any work done on that machine! It must be very frustrating.
In any event, it is almost impossible for us to do any real testing of
MAINSAIL at the ai-lab because of the incredibly heavy load there. There
is a user at su-ai who is using MAINSAIL, and he keeps us posted of bugs,
∂16-Nov-78 2041 MRC Re: LIV and autologout
To: LES, JMC
Please do not allow BH to flush the LIV privilege. It cannot be argued
that it is antisocial today, since all it does is make your punishment be
getting detached instead of autologged out. This sort of nastiness seems
to be only because BH does not approve of LIV.
Between this kind of garbage and other things likes like DCL getting
exclusive autologout immunity ala JMC, the lab has become a decidedly less
pleasant place to work in. For me, this all isn't helped terribly by
either my status at the lab (after one and a half years here, I'm still
not considered to be a member of the system programming group according to
the phone directory) or my income (which I've been told is low even by
Stanford standards, and is very low compared to what I've been offered in
the last 12 months).
∂17-Nov-78 0720 REM via AMES-TIP Latest data-compression research results
To: "@CRUNCH.DIS[1,REM]" at SU-AI, "@CRUPUB.DIS[1,REM]" at SU-AI
CC: WILCOX at SUMEX-AIM
I have a MAINSAIL program that scans a text file building up longer
and longer contexts whose frequency counts are each above a certain
threshold. It computes entropy at each left-context and puts them
into the output file. I have a second MAINSAIL program that triggers
a bug in the garbage collector in MAINSAIL, but by carefully specifying
the threshold (for entropy-reduction) large enough to avoid storage
filling up I was able to make the program run to completion. The
result, after running through my String-SORT/merge program, is a list
of important contexts in a file (in this case, the formal specifications
for the PCNet communication protocol), sorted in sequence by importance
(i.e. the most important ones are at the end). This file is currently
IRSMXY.2[1,REM]. The format of each line is:
<goodness> (context)
where <goodness> is the number of bits reduction by appending this
context to the tree that already has its parent, and context is
a string of ASCII characters except that control characters and
nonstandard printing characters are indicated by their meaning or
their octal value rather than appearing directly. Note that the syntax
for octal is "<" octal ">" so that to avoid ambiguity both "<" and ">"
are converted to octal when they appear in a context qua themselves.
Note that there are lots of contexts of length 3 and 4, but about 4
it starts to drop off, and past length 15 there are no useful contexts.
But note that out to 15 there are a few scattered useful contexts.
See IRSMXY.1 for unsorted data which appears shortest-first.
∂17-Nov-78 0922 HVA Concert Ticket
Arnice managed to get a ticket for tonight's concert - hope you can join us.
Thanks, I would like to join you.
∂17-Nov-78 1035 REM via AMES-TIP Analysis of latest data-compression research data
To: "@CRUNCH.DIS[1,REM]" at SU-AI, "@CRUPUB.DIS[1,REM]" at SU-AI
CC: WILCOX at SUMEX-AIM
I manually stepped (backwards) through the IRSMXY.XX2 file, checking that
each context waits for its parent (i.e. if I saw a node before its parent,
I shoved the parent in just before the node, even if it didn't contribute
to entropy-reduction). I added up all the reductions in bit count,
subtracting from the original file. First of all, of course, I flushed
the low-order bit (SOS LINE NUMBER BIT). I noted in particular how
many contexts needed to be included to achieve 2:1 compression and to
achieve 3:1 compression (overhead not included, thus these are slightly
optimistic). Results below:
ORIGINAL FILE, PROTO.PB1 -- 294372 BITS
Flushing line number bits -8177
286195 BITS
Null-context single-char. code -93467
192728 BITS
GROUP #1 CONTEXTS, SEE BELOW -46111
146616 BITS (2:1 ACHIEVED)
GROPU #2 CONTEXTS, SEE BELOW -48532
98085 BITS (3:1 ACHIEVED)
Group #1 includes 14 single-character contexts and one two-character
context (space space). Thus LINNUM+NULL+15 contexts achieve 2:1.
Group #2 includes 41 1-char, 93 2-char, 39 3-char, and one each of
4,5,6,7,8,9,10,11-char contexts (all the contexts of 4 or more chars
are simply long strings of spaces -- at thresholds of 6 and 11
spaces in a row the next character becomes more strongly determined,
enough so to produce useful compression not available at shorter
contexts) -- Thus 181 new contexts, LINNUM+NULL+196 contexts in all,
achieve 3:1 compression of this file (ignoring overhead).
∂17-Nov-78 1100 JMC*
Call Stanford about Sarah.
∂17-Nov-78 1121 TOB AL
John
We are planning to make an export version of AL
for researchers. This will be partly a research
tool for our own use, and partly a public service.
We will seek support from potential users and
interested organizations, and augment with NSF
support. We plan to hold a workshop in three months
and have work underway (volunteer work now). I
want your opinion and hopefully your approval.
Tom
You have my approval in advance of my opinion.
∂17-Nov-78 1214 HVA Various Plans
Am glad you can go to concert - tentative plans are to have a bite to eat at
China First - if you can stand it again this week (sans scientists from China).
ON ANOTHER MATTER - the Yamaha Recorder has arrived, thanks to Patte. And Patte
tells me we do have a cassette recorder with foot pedal somewhere around here.
∂17-Nov-78 1428 Jrobinson at SRI-KL (Jane Robinson)
Date: 17 Nov 1978 1428-PST
From: Jrobinson at SRI-KL (Jane Robinson)
To: jmc at SU-AI
John,
It just occurred to me that you might want a copy of the list of people who
helped last Sunday. Caroline Talcott gave me such a list, but unfortunately,
I deleted it, so I'll give you a copy of a sndmsg I sent to them instead.
Caroline, Hersche, and Bob Filman were really responsible for all of the
reception, Caroline and Bob for the ushers, and Bob arranged for the
printing.
Here's my note:
To: Hersche Allen, Bob Creary, Bob Filman, Dick Gabriel, Chris Goad,
Bob Moore, Ben Mozkowski, Rich Pattis, Dan Sleator,
Caroline Talcott, and Richard Weyrauch
When John asked me to coordinate a memorial service for Vera at
the Memorial Church, I was honored but also quite concerned about
my ability to put together something that would be right, since
I am not a member of the Stanford community and also have had no
previous experience in making such arrangements myself. I found
I didn't have to worry, thanks to you. Every detail was thoughtfully
taken care of. I hope you found the ceremony as beautiful as I did and
I want to express my personal gratitude to all of you - even though we may
not have met - for stepping forward and helping to create it.
It really could not have been done without your collective effort.
I hope you won't find this way of expressing my gratitude inappropriate.
Somehow a written note addressed to each one separately seemed
rather too formal and since we are all more or less members of the
computer science community, sndmsg felt like a friendlier way
to say thank you.
Jane Robinson
How are things with you? If you think you will be at loose ends Monday or
Tuesday, and would like me to cook dinner for you--your house or mine--
here's the offer.
Jane
-------
Jane,
I would rather take you out for dinner on Monday or Tuesday -
your choice. You shouldn't let me get into an excessively parasitic
mode of existence. I assume I'll see you tomorrow at the non-monotonic
meeting. Otherwise by net mail.
John
∂17-Nov-78 1614 Jrobinson at SRI-KL (Jane Robinson) dinner and party
Date: 17 Nov 1978 1614-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: dinner and party
To: JMC at SU-AI
I'd like that. I do expect to attend at least part of non-monotonics,
but if I don't or don't get a chance to find out from you, then sndmsg
as to when on Monday.
Jane
-------
I'll pick you up at home at 7pm if that's convenient.
∂17-Nov-78 1727 TOB computer
I propose to ask DEC for computer support for
Computer Aids to Mechanical Design and robotics.
I will use the rationale that our research has
led to the Scheinman PUMA arm which will sell hundreds
of LSI-11 computers, and that the computer system will
be used for all Unimate models. There are several thousand
Unimates out now, which gives an estimate of the market
which this research has led to. I think CAD will be bigger.
I would like your approval; one possibility is in connection
with Bernie Roth, since there is a space crunch in Computer
Science. I have not talked with Bernie yet. I am thinking
about a VAX. I would like your approval and your opinion,
especially about whether you see better alternatives to
going with an additional machine, and how to go about asking,
and whom to ask. I thought Jim Bell might be a starting
contact.
Tom
∂17-Nov-78 1746 TOB
todo
get date of SRI affiliates meeting from David
also arrange with TI, Graham Nudd - image processors
arrange a place
We invite you to a Workshop on Software for Assembly sponsored by
the Computer Integrated Assembly Systems project of the Stanford
Artificial Intelligence Laboratory.
The workshop
will be held on ******* at the Stanford Artificial Intelligence
Laboratory.
The purpose of the workshop is to describe plans for implementation
of an export version of the AL language for programmable assembly,
and to provide a last chance for interested organizations to guide
influence the implementation of a first export version
of AL. We will also demonstrate the current status of the AL system
and the POINTY system for advanced teaching by guiding.
We have held several workshops in the past in order to familiarize
experts in robotics and potential users of AL with the design and
implementation of the AL system. AL has been complete for a year
and major extensions are underway. From these workshops we have
evaluated the potential number of users of AL and needs of potential
users. We have been in contact with a number of organizations
who need a software system
as a basis for experimentation. There is none available in the public
domain. The robotics community is at a Babel branch point.
If these groups are forced to build their own systems, there will be
much duplication of effort, with some possibility of interesting variety.
We will lose the opportunity for diversity of effort in other ways, if
each needs to build the basic system, and lose the integrating effect of
a common representation and common system.
Implementation of a stand alone AL system on a minicomputer is underway.
We seek to give an opportunity to potential users, industrial robot
manufacturers, research groups, and computer manufacturers to
represent their interests and give counsel in the public version of AL.
We also seek participation of organizations in the AL implementation.
The consortium is expected to be launched in mid 1979.
A first version is planned to be available in a year after the launching
of a consortium, mid
1980. A fully portable version is expected to follow that by a year and
a half. The second version is expected to incorporate modifications suggested
on the basis of use of the first version.
A prospectus will be sent to potential participants. Participation
may be in the form of financial support, hardware support, or staff involvement in
AL implementation.
∂18-Nov-78 0859 Jrobinson at SRI-KL (Jane Robinson) 7 it is
Date: 18 Nov 1978 0901-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: 7 it is
To: jmc at SU-AI
and convenient.
-------
∂18-Nov-78 1625 DCL What the new CS/EE 20-60 will do for the AI lab overload
To: JMC
CC: LES
John, you mentioned in conversation apropos my last message about CS student
use of the AI lab during busy hours, that they would movee to the new
machine in January.
This is not so.
Accordinng to Ed. the NSF funds require the machine to be used for research only;
no courses etc. Use of the AI Lab. machine unrelated to any research project
will continue.
-David
In my opinion, we will be able to classify much of what the students do as
research or in support of research. Moreover, the NSF hasn't funded the
whole machine, and the part funded by department gift funds can be used
at the discretion of the Department. I will put some pressure on Ed when
appropriate.
∂18-Nov-78 1638 DCL
To: "@GROUP.DIS[VCG,DCL]" at SU-AI
***********************************************************************
VERIFICATION GROUP SEMINAR
TUESDAY 21st NOVEMBER
PLACE: ERL 237
TIME: 2:30 p.m.
TITLE: The Algol Block Concept as a Basis for Programming Language
Development.
SPEAKER: Professor Ole-Johan Dahl
ABSTRACT
The development of Simula67 showed that the Algol block concept
was a fruitful starting point for subsequent bending and stretching.
Many other language constructs may be viewed in the same light. Thus, the
block concept may be modified to cover concepts like procedures, classes,
"types", "modules", data descriptions, "contexts" of programming (and
verification), special purpose (sub-)languages, etc. Two of the most
difficult issues facing language developers are: unity versus specialized
constructs, and orthogonality versus ad-hoc restrictions.
∂18-Nov-78 1850 REM via SU-TIP Significant-context surveys
To: "@CRUNCH.DIS[1,REM]" at SU-AI
To keep things simple, I have renamed all sorted versions of
significant-context files (produced by IC4B then sorted by SSORT)
to have extension CXT. Thus look for *.CXT[1,REM] to see my surveys
of various files, currently two different PCNet documents and one
mainsail system source file.
∂19-Nov-78 0738 DCO
To: "@SIMP.DIS[1,DCO]" at SU-AI
The following is the most recent announcement of a new version of
the simplifier. Previously I sent these announcements only to users of
our verifier, but since the only available description of the simplifier
(POPL paper) describes the original version Greg Nelson and I wrote in
early 1977 and is considerably out of date (I have rewritten the
simplifier several times since then), I have made up this mailing list.
If you do NOT want to be on it, tell me!
I am also about to write up a short description of the simplifier
which I will send you if interested.
New Z
I have written a new Z (the prover for arithmetic) which, on the
examples run to date, cuts in half the time for proofs requiring
arithmetic. (The time for proving the 91 function drops from .37 secs to
.20 secs, for the iterative 91 function from .9 secs to .4 secs, etc.)
The new Z uses the same simplex algorithm as its core as did the
old Z that Greg Nelson wrote. I have not yet done any timing studies on Z
itself, but since the total times for proofs are more or less half what
they used to be, the new Z presumably runs considerably more than two
times faster than the old. It also uses much less space. The space
required in E to store an inequality like a < b is 3/7 of what it used to
be. The size of the tableau in the new Z will be much smaller -- roughly
one third the number of rows.
The new Z is designed to be independent of the outside
representation of variables and constants -- Z accepts as input linear
sums of <object>s. The type of <object> is unknown to Z -- it can be an
atom, number, s-expression, string, Enode (in our case) or whatever. The
outside environment has to provide Z with a type predicate that returns T
when given an <object> and NIL otherwise. Z must also be told what
symbols are used for arithmetic functions and relations. There is a
function DEFINEARITHMETIC() for this; DEFINEARITHMETIC(+ - * ≥ > ≤ <) is
used by SIMPLE, DEFINEARITHMETIC(!plus !minus !times !ge !gt !le !lt) by
the Pascal verifier -- Z thus runs independently of the choice of external
syntax for arithmetic symbols. I also provide a "handshaking" function
which is used to coordinate Z and the outside environment on what the
external and internal names of 0 and 1 are. Thus, Z should interface
reasonably easily with most other programs.
Since my Z has a much simpler interface, I have been able to
remove great chunks of code from the top level simplifier and from E.
Note that this Z is incompatible with Greg's -- there is no notion of
TOKENZ or anything like that, so anyone who wants to shift over to my Z
will have to make changes (all will involve removing code).
∂19-Nov-78 1046 LCW SMA3
To: S1 at SU-AI
All files relating to the S1 Architecture Manual have been moved onto
[SMA,S1]. See INDEX[DOC,S1]/25p for details.
BTH
∂19-Nov-78 1642 JC Thanks
...just a note to extend thanks from us all for `lending' your place
for the reception on Friday evening. We considered the concert a
great success as most everyone liked at least one piece on the program.
Reviews of the concert are next to the music bulletin board.
Although I was unable to attend the service for Vera.. I certainly
was in spirit.
We will get the tapes done tomorrow.
John
∂20-Nov-78 1252 JMC Ershov visit
To: DEK at SU-AI, feigenbaum at SUMEX-AIM, TW at SU-AI, ZM at SU-AI,
JMC at SU-AI
Andrei Ershov just phoned me with the following information. He will
arrive Friday afternoon at 2:59 on AA 17 and leave 10pm Sunday for
Washington, D.C. He will stay at my house. He would like to talk
to Don Knuth about TEX and the Uzbekistan meeting. Also with Feigenbaum
topic not stated. Also with Manna about MTC work in Novosibirsk. If
possible he would like to visit PARC. Friday afternoon might be good
if PARC is functional on Friday. His present responsibilities are now
concentrated on natural language, text processing and use of computers
in education. If the visit can't be arranged, he would still like to
talk with Terry about these things. A lower priority is meeting Armer
and other people socially.
Let me suggest that someone with lots of left-over turkey or
other things arrange a fairly large dinner Friday, Saturday or even
Sunday evening.
∂20-Nov-78 1316 Feigenbaum at SUMEX-AIM ershov visit
Date: 20 Nov 1978 1316-PST
From: Feigenbaum at SUMEX-AIM
Subject: ershov visit
To: jmc at SAIL
John, because of weekend travel and a commitment for Sunday evening, my
window for talkig with Andrei is fairly narrow, namely Sunday afternoon.
Please save that time for me. Where will he be at that time?
Ed
-------
I will reserve Sunday afternoon for you. Unless there is some other
plan, he will be at my house.
∂20-Nov-78 1414 LES S1
To: FB
CC: JMC
We still owe LLL a new proposal. A draft still resides in S2.PUB[D,LES].
I need to get you and JMC in the same room again to resolve one or two
questions and figure out what else, if anything, needs to be added.
How about late Tuesday afternoon, or as soon as possible thereafter?
∂20-Nov-78 1518 REF
∂20-Nov-78 1201 JMC Computer Forum
Do you think you will have made enough progress on describing other
people's files to give a presentation at the Computer Forum early
in February. Many potential employers will be present. You could
also talk about combining obsrvation and inference, but I think
the former topic would interest the audience more.
Thanks for the invitation.
A] I'm going to the Automatic deduction workshop Feb. 1-3.
If that's when the computer forum is, well...
b] I'd feel much more comfortable talking about something that's
essentially done, (observation and inference) than something that
isn't (describing files). If, however, you'd really rather hear about
the "other people's files", then I guess we can talk about it....
bob
∂20-Nov-78 1751 REM via AMES-TIP First test of IC2 on 80-column-formatted text
To: "@CRUNCH.DIS[1,REM]" at SU-AI, "@CRUPUB.DIS[1,REM]" at SU-AI
Input file was 6 pages (each 1000 lines of 80 chars) from Webster's
pocket dictionary. Format is grossly wasteful of space, probably
designed to interface directly with some typesetting equipment.
Input file 98401 words (multiply by 5 to get character count),
crunched file 11388 words, compression ratio 8.64 to one.
Input was 7-bit characters instead of 8-bit characters, but has
<cr><lf> at end of each line, so compression ratio is about the
same as would be expected for IBM 360/370 files. Note, this is
the adaptive program IC2. The 2-pass algorithm isn't yet fully
programmed, maybe next month the c.r. will be even better.
∂21-Nov-78 0841 DEK Ershov visit
My time is flexible this weekend. I'd like to spend a few hours up at the
lab with Andrei, whenever it's convenient for him.
Jill says we will surely have leftover food, but she hasn't energy to make
two fancy meals in one week. So she suggests either a potluck or an
informal meal eating leftovers. It can be at our house either Saturday
or Sunday.
Whoops, I forgot to send carbon copies of this letter to Ed and Terry.
Can you forward it for me?
∂21-Nov-78 1219 HVA Party for Ted
CC: LES, JMC, PAT, JW
Ted says Friday, Dec. 1st will be "just perfect". We should probably send message
and post sign-up sheets for pot luck no later than tomorrow (11/22). I will order
and bring sheet cake as my contribution - that should take care of dessert.
∂21-Nov-78 1407 Mcgoveran at SUMEX-AIM Weizenbaum
Date: 21 Nov 1978 1400-PST
From: Mcgoveran at SUMEX-AIM
Subject: Weizenbaum
To: JMC at SAIL
A month ago, Ed received a letter from Murray Webster, who is writing a
chapter on role-taking for the 1979 ANNUAL REVIEW OF SOCIOLOGY and who is
interested is getting a copy of your responses to Weizenbaum's book,
COMPUTER POWER AND HUMAN REASON.
I have a copy of the reviews by Bruce Buchanan, Joshua Lederberg, and yourself.
But that is only one review by you, while Webster writes of 'several responses.'
Are the several responses embodied in that one review?
Mary McGoveran
-------
Another review of mine was published in the February 1977 Physics Today.
∂21-Nov-78 1420 Feigenbaum at SUMEX-AIM ershov visit
Date: 21 Nov 1978 1416-PST
From: Feigenbaum at SUMEX-AIM
Subject: ershov visit
To: jmc at SAIL
cc: dek at SAIL
Will there be a seminar by Andrei on Sunday afternoon? If so , when and where?
ed
p.s. what subject?
-------
∂21-Nov-78 1430 HVA Tapes
The tapes have been copied and I've checked out the transcribing unit which
works well. I don't plan to transcribe the tapes during the usual working day,
of course, but would like to start them very soon, and I would like your advice
on protected areas - do you have areas that are more protected than mine? I
hope you will be in later....
∂21-Nov-78 1714 BH
You have exceeded your disk quota.
The files listed below have been purged to reduce your disk
area to your quota of 2000
Before purging, your files occupied 2296
BACKUP.TMP[S78,JMC]
BACKUP.TMP[E78,JMC]
ERRORS.TMP[LOT,JMC]
BACKUP.TMP[F78,JMC]
PPSAV.TMP[LET,JMC]
ERRORS.TMP[LET,JMC]
QQPUB.RPG[LOT,JMC]
KNOW.LST[S78,JMC]
DIALNE.LST[DIA,JMC]
CODE.DMP[ 2,JMC]
CRYPT.DMP[ 2,JMC]
LFOL.DMP[F78,JMC]
REV1.DMP[F78,JMC]
RECURS.XGP[W78,JMC]
SET.XGP[W78,JMC]
OWE.XGP[F76,JMC]
GORIN3.XGP[LOT,JMC]
ARTIFI.XGP[W78,JMC]
HUA.XGP[LET,JMC]
KIM.XGP[LET,JMC]
SKILLI.XGP[LET,JMC]
SCULLI.XGP[LET,JMC]
TOUR.XGP[S78,JMC]
CHING.XGP[LET,JMC]
CHU.XGP[LET,JMC]
LEE.XGP[LET,JMC]
CHOI.XGP[LET,JMC]
PRIPST.XGP[LET,JMC]
DOLBEC.XGP[LET,JMC]
CBCL.XGP[LET,JMC]
COMPUT.XGP[LET,JMC]
STOYAN.XGP[LET,JMC]
GRAEVE.XGP[LET,JMC]
MINIMA.XGP[LET,JMC]
MCDERM.XGP[LET,JMC]
EXOTIC.XGP[LET,JMC]
TESAR.XGP[LET,JMC]
COREWA.XGP[LET,JMC]
CARTWR.XGP[LET,JMC]
TAKEUC.XGP[LET,JMC]
RELATI.XGP[CUR,JMC]
∂21-Nov-78 1722 BH
To: S1 at SU-AI
You have exceeded your disk quota.
The files listed below have been purged to reduce your disk
area to your quota of 7000
Before purging, your files occupied 9288
DIF.TMP[MK1, S1]
PPSAV.TMP[ 11, S1]
PPSAV.TMP[MIC, S1]
TABCON.TMP[DOC, S1]
SECREF.TMP[DOC, S1]
SOPAW4.LST[SOP, S1]
DSKPOA.LST[MIC, S1]
POA.LST[MIC, S1]
DOA.LST[MIC, S1]
F.LST[MIC, S1]
PCPW5.LST[PCP, S1]
EOA.LST[MIC, S1]
IOA.LST[MIC, S1]
SOPAE1.LST[SOP, S1]
TSTW5.LST[SOP, S1]
RIMLOD.LST[PRG, S1]
XFER.LST[ 11, S1]
SMA3.LST[SMA, S1]
P.LST[MIC, S1]
DSKP.LST[MIC, S1]
D.LST[MIC, S1]
I.LST[MIC, S1]
SOPAW6.LST[SOP, S1]
E.LST[MIC, S1]
B2P.REL[MEM, S1]
OPS.REL[OPS, S1]
F.BIN[MIC, S1]
XLOSE.BIN[MIC, S1]
XFER.BIN[ 11, S1]
D.BIN[MIC, S1]
P.BIN[MIC, S1]
DSKP.BIN[MIC, S1]
I.BIN[MIC, S1]
MAKDDT.BIN[ 11, S1]
E.BIN[MIC, S1]
MICRO.DMP[ SW, S1]
PLOT.DMP[ SW, S1]
MU.DMP[MEM, S1]
MC.DMP[MEM, S1]
PLOT.DMP[DMP, S1]
FASM.DMP[OLD, S1]
RIX.DMP[DMP, S1]
PCP.DMP[MEM, S1]
PC.DMP[MEM, S1]
GLOBAL.DMP[MIC, S1]
EXR.DMP[OLD, S1]
UYK.DMP[PRG, S1]
PCPASX.DMP[DMP, S1]
SOPAE1.DMP[DMP, S1]
SINE.DMP[PRG, S1]
OMICRO.DMP[MIC, S1]
PCPW4.DMP[DMP, S1]
TEST.DMP[PRG, S1]
RIMLOD.DMP[PRG, S1]
DIAL.DMP[MIC, S1]
TEST.DMP[MIC, S1]
SOPAW6.DMP[DMP, S1]
FSIM.DMP[OLD, S1]
SOPAW4.DMP[DMP, S1]
DDT.DMP[PRG, S1]
LDILOD.DMP[PRG, S1]
PCPW5.DMP[DMP, S1]
TEN.DMP[PRG, S1]
FSIM.DMP[PRG, S1]
MICRO.DMP[MIC, S1]
SOPAW6.DMP[SOP, S1]
∂21-Nov-78 1816 BH purge
To: AB at SU-AI, DPB at SU-AI, GHB at SU-AI, GLS at SU-AI,
JMC at SU-AI, MMM at SU-AI, MUS at SU-AI, MUZ at SU-AI,
MWK at SU-AI, ND at SU-AI, PAM at SU-AI, PB at SU-AI, PEG at SU-AI,
PTZ at SU-AI, RLD at SU-AI, RXM at SU-AI, S1 at SU-AI,
TED at SU-AI, VDS at SU-AI, WCN at SU-AI, WD at SU-AI,
ZM at SU-AI
Actually your files have not been deleted. However, you'd better
delete some yourself or else get your allocation raised before the
next purge!
∂21-Nov-78 1816 BH purge
To: AB at SU-AI, DPB at SU-AI, GHB at SU-AI, GLS at SU-AI,
JMC at SU-AI, MMM at SU-AI, MUS at SU-AI, MUZ at SU-AI,
MWK at SU-AI, ND at SU-AI, PAM at SU-AI, PB at SU-AI, PEG at SU-AI,
PTZ at SU-AI, RLD at SU-AI, RXM at SU-AI, S1 at SU-AI,
TED at SU-AI, VDS at SU-AI, WCN at SU-AI, WD at SU-AI,
ZM at SU-AI
Actually your files have not been deleted. However, you'd better
delete some yourself or else get your allocation raised before the
next purge!
∂22-Nov-78 1024 TW
To: JMC at SU-AI, DEK at SU-AI, feigenbaum at SUMEX-AIM
I didn't know anything about Ershov's visit before today, and am
planning to be away for the whole weekend. I am leaving for New
Jersey at 1:45 today, and arriving back (at SFO) Sun at 7:05 pm.
We booked these flights months in advance to get super-saver fares,
and can't change them without a lot of extra cost (also, flights
are all full to overbooked this weekend). If he would be interested
in an airport meeting and is flying out of SFO, we might get
together Sun evening. If you want to contact me tonight or
Sat. night throgh Sun afternoon, I will be at (201)246-7214
On Thurs and Fri we will be with Carol's uncle and aunt
(Joe Dembo, Groton Connecticut) whose number I don't know off
hand, but you can get it from information.
If I don't hear from you, I will assume it didn't work out,
but you can still catch me on the arrival of TWA753.
--terry
∂22-Nov-78 1045 HVA Reception Bills
Since you asked yesterday, and the Tresidder bill ($85.10), arrived yesterday,
I might willingly aceept a check for that. The Beltramo's bill (est.$46.41 incl.
credit for items returned), will probably not be rec'd for awhile and I would
like to make a personal contribution toward the wine. O.K.?
∂22-Nov-78 1100 ARK*
To: S1 at SU-AI
There will be an S1 staff meeting on Wednesday, 29 November at 1:15 pm in the
Serra Conference Room. Remember that progress reports are due on Monday.
Arthur
∂22-Nov-78 1950 CLT
I'm off. Back Sunday. Have a good weekend.
∂22-Nov-78 2033 DEK developments
It appears that Feigenbaum and possibly Winograd will be seeing Ershov
on Sunday, so the best thing would be for me to be his companion on
Saturday. How's this for an idea? I would pick him up at your house or
meet him at the lab, sometime saturday, and spend several hours at least
with him. (three or four hours is probably enough for everything i
have in mind now.) Then for supper we can either eat out (with you in
attendance at your option) or perhaps the
scene of the evening meal would be our house for leftovers ---
the latter possibility should be decided dynamically on saturday, because
jill is a little under the weather and it's not clear how she'll be
feeling on saturday.
On another topic, Feigenbaum confirmed to me
that Les has spoken of resigning at an alarmingly early but
unspecified time. That came as a shock, I hope he can reconsider. To me (as citizen of both
"cultures") I think there is a tendency for
AI lab people to view the forthcoming move as traumatic, but I don't really
think it will be so difficult. However, my reasons for feeling this were
largely based on the assumption that Les would be one of the
important leaders holding the show together. Gosh,
maybe he doesn't want to spend all his life in his present position, but
if he waits a year or so before resigning he can do so with
a feeling of accomplishment in leaving a "going operation" rather than with
a feeling a guilt that he was bailing out of a sinking ship.... Without Les,
the move might well be catastrophic. And I myself don't have either
the expertise or the extra cycles to help
come to the rescue. Ed says he plans to talk to you about your feelings
in this next week at mit.
Please excuse this incoherent letter, I can't compose well at a keyboard.
Your Saturday proposal seems optimal to me. I suggest you phone
Friday night or Saturday morning when you become functional to set
a time. Eating collectively seems like a good idea either in or out.
∂23-Nov-78 0112 MRC Bad news
I went over to GSB on Wednesday. Not only didn't we get the modem
working, in the course of trying to figure out what was wrong we
fried the DAA and possibly also the modem. When smoke came out of
the DAA we decided to punt until Monday.
What's more, while putting cables under the floor I managed to drop
a floor panel on my left middle finger (the one you use to type E
on a keyboard). There is now a nice bit of blood drying under my
fingernail and it is quite painful. Needless to say, typing isn't
doing very much to help it. I'd go to the doctor if I thought he
would do anything other than tell me let it grow out in a couple of
months.
Anyway, I'm quite unhappy (to say the least!) right now and quite
unlikely to get much of anything done for a while (at least not
until the pain in my finger subsides).
∂23-Nov-78 0834 FB S1 proposal
To: LES, JMC
I have been working on the S1 proposal and will be glad to meet with you on
Tuesday afternoon. I was in Washington all this past week.
∂23-Nov-78 1157 REP CS-206
Yes I got your message and will conduct class both Tuesday and Thursday
this week.
Rich
∂24-Nov-78 0402 LLW
To: JMC, FB
CC: LLW
∂23-Nov-78 0927 JMC
To: LLW
CC: FB
Are you available to meet with Forest and me this weekend? By phone?
[Certainly. Preferably afternoons or evenings, either in person or in
Telco persona. Suggest a date, time and place by net mail; if you prefer
to set up something on short notice, I can be reached at 422-7286 or
422-0758 most of the time that I'm awake. Best regards, Lowell]
∂24-Nov-78 1328 FB meetings
Is dinner still on at 7? If so, where do we meet.
For meeting with Lowell, let me know your preferences.
∂26-Nov-78 0316 REM via AMES-TIP More results on IC2, including pseudo-IBM360 file
To: "@CRUNCH.DIS[1,REM]" at SU-AI, "@CRUPUB.DIS[1,REM]" at SU-AI
I wrote a short program to find the longest line in a file, and then
to convert the file to fixed-length records according to a user-supplied
length (usually about the same). Before either, it converts tabs to
the appropriate number of spaces. I did this to NOTICE[UP,DOC], a
collection of old and new system messages and preliminary documentation,
which mostly has full lines of text and only moderate numbers of short
or blank lines. Thus the file is characteristic of documentation rather
than program text, and due to various authorship fairly represents a
distribution of different short files on one computer system. I then
applied IC2 to both the IBM-format LRECL=80 file (no cr/lf, just bare
data) and the original PDP-10 file (variable-length lines but with crlf
after each line and many nulls at end of each page, nulls were removed
for the IBM version)...
Original, 91904 words = 3308544 bits.
IBM simulated 8-bit bytes, 622080 bytes = 4976640 bits.
Crunched original, 1047636 bits.
Crunched IBM, 1088532.
Compression ratio for PDP-10 file, 3.15 to one.
Compression ratio for IBM file, 4.57 to one.
Cross-compression ratio, if the IBM file were first reformatted to have
variable-length records like the PDP-10 then compression were applied to
the result, 4.75 to one.
Note that program files, which typically have short lines except for
longwinded comments and a few complicated formulas, should compress much
better (from IBM input) than the above documentation file.
∂26-Nov-78 0430 REM via AMES-TIP More results on pseudo-IBM files, FORTRASH this time.
To: "@CRUNCH.DIS[1,REM]" at SU-AI, "@CRUPUB.DIS[1,REM]" at SU-AI
I collected about 66k of *.F4[*,*] from SU-AI, converted to IBM LRECL=80,
and used IC2 to crunch both original and IBM versions...
Original: 67903 words = 2444508 bits.
IBM LRECL=80: 1107200 bytes = 8857600 bits.
Crunched original: 929772 bits.
Crunched IBM: 1056096 bits.
Compression ratio for PDP-10 format file: 2.6 to one.
Compression ratio for IBM LRECL=80 format file: 8.38 to one.
Cross-compression ratio (take IBM input, convert to variable-record by
flushing trailing spaces and inserting CRLF, then crunch): 9.5 to one.
All this with IC2 which is adaptive, picking up new contexts until memory
fills, and gradually learning statistics of file as it compresses
inefficiently at first and better and better as it learns.
As soon as a bug in MAINSAIL compiler is fixed, I'll continue work on
the two-pass version which is expected to be even better for compressing
mostly-homogeneous files like the above.
∂26-Nov-78 1412 LCW Open House
To: EJG at SU-AI, FB at SU-AI, GIO at SU-AI, PN at SU-AI, JMC at SU-AI,
JLH at SU-AI
CC: LCW at SU-AI, LLW at SU-AI
S1 Industry Open House is all day Thursday, December 7. Please call
Charlotte Richmond 415 422-7286 to make reservations. Attendees must be
cleared in advance. If you have industrial contacts who should attend,
please refer them also to Charlotte. PN should be on hand to advertise
FORTRAN. This message is an invitation to attend.
Curt
∂26-Nov-78 1649 DCL
To: "@GROUP.VER[VCG,DCL]"
***********************************************************************
VERIFICATION GROUP SEMINAR
TUESDAY 28th NOVEMBER
PLACE: ERL 237
TIME: 2:30 p.m.
TITLE: Modules
SPEAKER: David Luckham
ABSTRACT
We propose a method of documenting programs containing modules and of
proving consistency between code and documentation. We introduce
(i) assertions about history sequences of module operations, and (ii) a
programming construct for module definition in which specific kinds of
documentation are required as an integral part. Axioms and proof rules
are given for module definition, module creation, and for module function
and procedure call. This extends the axiomatic semantics of Pascal given
by Hoare and Wirth. Within this logical system a proof of correctness of a
program using a module is seperated from the proof of correctness of the
module implementation. The axioms and proof rules are easy to implement
in automated program checking systems. The use of history sequences in
documentation and proofs is illustrated by examples. We will discuss how
the history sequence method can be used to specify the behaviour of
modules that are intended to operate in a concurrent environment.
∂26-Nov-78 2020 WP :"Fixed points of LISP functions"
To: JMC, CLT
CC: WP
I was reading chapter 3 of "LISP programming and proving".
The chapter gives the impression that a LISP program
computes the least fixed point. This is of course not so; even for
suitably nice programs:
bot(x)←bot(x)
const(x)←3
foo(x)←const(bot(x))
The least fixed point of these definitions is
(bottom, λx.3, λx.3). But any LISP program will compute
(bottom, λx.3, bottom).
I thought of fixing this by giving all function terms in the
language a call by value meaning. But this seems not to work right
because you also allow for λ-conversion which of cause is a
call by name rule.
Another way seems to convert LISP functions into strict
functions in the first order language. But then the conversion can no
longer be done by simply replacing ← by =. To be precise, one could
define
STRICT(f)=λx. if x=bottom then bottom else f(x)
and convert a LISP definition f←TAU(f) into the sentence
f=STRICT(TAU(f)).
Wolf
For this chapter, I prefer the least complicated way of making it
correct, but we certainly have to say something.
∂26-Nov-78 2159 MINSKY at MIT-AI (Marvin Minsky)
Date: 27 NOV 1978 0101-EST
From: MINSKY at MIT-AI (Marvin Minsky)
To: jmc at SU-AI
Hi. Are you there or in Boston?
I'm still here, and will arrive Boston UA 95 7:40 PM Monday.
∂27-Nov-78 0900 ARK* Reminder-S1 Meeting
To: S1 at SU-AI
There will be an S1 staff meeting on Wednesday, 29 November at 1:15 pm in
the Serra Conference Room. Remember that progress reports are due today,
Monday.
Arthur
∂27-Nov-78 1334 CLT
To: WP, JMC
I realize that there are difficulties with among other things constant functions
and strictness. The presentation in the current chapter III is fuzzy on that
respect because the details are not yet formalized. This should happen
next quarter, and then I can answer your comment more intelligently. Two points
however. The replacement of ← by = gets quantified only over S-expressions
thus begging the question at that point of what f(bottom) is in general.
Also no schema is given for completing the characterization of mutual recursive
definitions. This will be spinoff from the formalization task.
Thanks for your comments.
Carolyn
∂28-Nov-78 1421 PAT phone calls
Mark Mellman of Committee for Concerned Scientists called regarding the
Dec 27-29 meeting in Moscow. (212) 686-8862
Warner Frank of Informatics in Woodland Hills called. Larry Zeffer of
the Israeli government agency for ILTAM will be visiting and would like
to make an appointment to talk with you concerning computers and
communication at 10am on Dec 8. I told his secretary that I would call
her back if that was not alright.
∂28-Nov-78 2323 BIL s1 manual error
To: "@S1[DIS,S1]" at SU-AI
Peter Schwartz is thanked twice in the same sentence in the Acknowledgements
section of the S1 manual.
∂29-Nov-78 1345 Greep at Rand-Unix Proposal for CS206 project
Date: Wed, 29 Nov 78 13:46-PST
Subject: Proposal for CS206 project
From: Greep at Rand-Unix
To: JMC at Su-Ai
cc: Greep at Rand-Unix
Message-ID: <Greep.78.332.134657 @ Rand-Unix>
How would writing a compiler for a stripped-down version of C (a language
similar to BCPL) be? I would plan to write the parser and code generator
(say for PDP-10 assembly language), and maybe the lexical scanner.
The source language would have most of the features of C except for
the various data types such as pointers and structures. The recognizer
would be a top-down parser that would read from a file a grammar
in a form similar to BNF so it would be relatively language-independent.
I realize it is late to be just starting a project (my only excuse
is that I had problems with other classes) but think I could finish
this by the end of the quarter if I start now. Please let me know
if this sounds like a reasonable project of if you can suggest any
modifications that would make it one. (I was going to ask you in
class yesterday but Rich says you will be out of town all week and I
would like to begin by this weekend.)
Steven Tepper
OK, but I suppose I was hoping you would do something more
interesting, i.e. more theoretical.
∂29-Nov-78 1436 SJF modal logic seminar
To: "@MODAL.DIS[1,SSO]" at SU-AI
On Thursday, 11/30, at 2:45, Shel Finkelstein will speak on Yatsang Kwong's
papers, "Livelocks in Parallel Programming". Livelock is a generalization of
starvation or blocking. Kwong describes techniques for proving that a
parallel program is livelock-free, and shows that fair implementations of
of livelock-free abstract parallel programs will also be livelock-free.
Although Kwong does not use modalities, there will be some formal hand-waving
in modal logic, especially in presenting definitions.
∂29-Nov-78 1456 Jrobinson at SRI-KL (Jane Robinson)
Date: 29 Nov 1978 1457-PST
From: Jrobinson at SRI-KL (Jane Robinson)
To: jmc at SU-AI
Hello, John
Before you take off for Amherst, could you let me have
Ursula's and Fran's addresses?
Have a good trip. Maybe we can get together for supper at louie's when
you get back.
Jane
-------
Fran is at Thomas J. Watson Research Center, Yorktown Heights, N.Y.
and Ursula is at Computer Science Department, University of Alberta,
Edmonton, Alberta, Canada. If you need home addresses, I can dig
them up. Supper sounds good, but I ration my visits to restaurants
where I am inclined to eat a lot.
∂30-Nov-78 0444 REM
To: RWW, JMC
∂27-Nov-78 1403 lauren at UCLA-Security data compression licensing
Date: 27 Nov 1978 1400-PST
Sender: lauren at UCLA-Security
Subject: data compression licensing
From: lauren at UCLA-Security
To: REM at SAIL
This may be jumping the gun a bit -- but I might as well ask.
I am in the process now of starting up a firm to sell microcomputer
software (specifically for CP/M systems to start with). One of
the items I think would have a high sales value would be file
compression programs and systems. Since most of these systems operate
with limited floppy resources -- space is at a premium. I was planning
to use a simple Huffman scheme to pick up 30-40% on text files --
but it might be amusing at some point to go further into sorts of
things on which you're working. How you feel about licensing
your technique at some point?
--Lauren--
-------
Use Lauren message to prod Stanford.
∂30-Nov-78 1119 DEK
I had a phone call from Peter Crawley in the math dept at Provo.
His collegue Vladimir Lipshitz is a Russian emigre who seems to be
excellent at logic and computability theory. Crawley has extremely
high standards, so this can be considered an excellent recommendation.
Lipschitz wants to spend a year at Stanford if there's a place for
him. I said the chances were slim, but you would possibly be able
to support him. He (Lipschutz) will call you.
As you can see, I don't know how to spell his (Lipshutz's) name.
∂01-Dec-78 1446 SSO Party
To: "@MODAL.DIS[1,SSO]" at SU-AI
I want to have a party for modal logic participants and hangers-on. There
seem to be two possible dates -- Dec. 15 (the Friday of finals week) or
early in January. The main trouble with the 15th is that many people may
be out of town by then. Would you let me know which day you prefer?
Thanks,
Sue Owicki
∂03-Dec-78 1134 MRC DIALNET
WELL, IT TURNED OUT FROM WHAT I FOUND OUT AT DECUS AND LOOKING CLOSER
AT THE CODE THAT THE KLUDGES NECESSARY TO EVADE THE SCANNER SERVICE AND
YET REMAIN A TTY LINE (IE, TO USE THE TTY LINE STUFF IN THE FRONT END)
PROVED TO BE TOO HORRIBLE TO CONTEMPLATE. NOT MUCH WOULD BE GAINED AND
A GREAT DEAL OF OVERHEAD WILL BE LOST. I'VE SUGGESTED TO LES THAT WE
SHOULD GO AND HIRE SOME STUDENT WHO KNOWS THE INS AND OUTS OF PDP-11'S
AND THE RSX-11 MONITOR. I'M DEEPLY ENMESHED IN THE NEW PDP-10 CODE
WITH GROSSLY REWRITTEN STUFF ALL OVER THE PLACE AND IT WILL TAKE MUCH
LONGER IF I HAVE TO DO THE 11 STUFF TOO (I KNOW NOTHING ABOUT PDP-11S).
P.S. IT TURNED OUT THAT THE MODEM WAS NOT DAMAGED AT ALL. IT IS
PERFECTLY FINE. HOWEVER, EITHER THE DAA OR THE INTERFACE CABLE IS A
LOSER. IT IS UNCLEAR WHICH AS YET, BUT WE'LL INVESTIGATE FURTHER ON
MONDAY.
∂03-Dec-78 1414 SSO via SU-TIP Party
To: "@MODAL.DIS[1,SSO]" at SU-AI
There has been an overwhelming vote that either date is OK, with a small but
convincing minority who can't attend on December 15. So let's make it
January, probably Friday the 8th. More details in January.
Sue
∂04-Dec-78 1212 HQM at MIT-AI (Henry Minsky)
Date: 4 DEC 1978 1512-EST
From: HQM at MIT-AI (Henry Minsky)
To: JMC at MIT-AI
Sarah called on Sunday night. She wanted you
to call her.
Henry
∂04-Dec-78 1654 DCL
To: "@GROUP.DIS[VCG,DCL]" at SU-AI
***********************************************************************
NO SEMINAR ON TUESDAY 5TH DEC.
***********************************************************************
VERIFICATION GROUP SEMINAR
TUESDAY 13th DECEMBER
PLACE: ERL 237
TIME: 2:30 p.m.
TITLE: Modules (Part 2)
SPEAKER: David Luckham
ABSTRACT
We propose a method of documenting programs containing modules and of
proving consistency between code and documentation. We introduce
(i) assertions about history sequences of module operations, and (ii) a
programming construct for module definition in which specific kinds of
documentation are required as an integral part. Axioms and proof rules
are given for module definition, module creation, and for module function
and procedure call. This extends the axiomatic semantics of Pascal given
by Hoare and Wirth. Within this logical system a proof of correctness of a
program using a module is seperated from the proof of correctness of the
module implementation. The axioms and proof rules are easy to implement
in automated program checking systems. The use of history sequences in
documentation and proofs is illustrated by examples. We will discuss how
the history sequence method can be used to specify the behaviour of
modules that are intended to operate in a concurrent environment.
∂04-Dec-78 1816 SJF bimodal logic
To: "@MODAL.DIS[1,SSO]" at SU-AI
On Thursday, I'll continue the discussion of Y.S. Kwong's livelock papers
using the "bimodal" logic that I defined last time. The "crib sheet" for
that lecture is available for those who missed the first talk and want to
catch up. The seminar meets as usual at 2:45, in ERL 237.
∂04-Dec-78 2100 DPB TA for 258?
John,
Have you committed to a TA for CS258 yet? I have some general
volunteers I can send you for interview. I have estimated that
you will need a quarter time person. How does that sound?
Also, I am assuming that you don't plan to teach in the spring,
right? -Denny
∂05-Dec-78 1003 REP CS-206 Final
Should we get together sometime in the near future to discuss the
CS-206 final? I believe the final is to be given on Thursday Dec. 14 in
the evening.
Rich
Sure. I'll be glad for your ideas on that. We'll talk about it after
class.
∂05-Dec-78 1026 MAILER failed mail returned
∂05-Dec-78 1223 DPB Russian mathematician visiting
∂05-Dec-78 1100 Tajnai at SUMEX-AIM Math Dept. needs someone who speaks Russian
Date: 5 Dec 1978 1101-PST
From: Tajnai at SUMEX-AIM
Subject: Math Dept. needs someone who speaks Russian
To: bcm at SAIL
cc: dpb at SAIL
Ben, there is Russian Mathematician visiting in Math; he is also
interested in CS; he will be there for 6 weeks; they are having
problems with translation. Do you speak Russian??
Do you know anyone who does?
Carolyn
-------
∂05-Dec-78 1626 LES S1 proposal
To: JMC, FB
It is now December 4 and the current S1 funding runs out at the end of this
month. It is questionable whether new funding can be obtained by January.
In any case, we had better hustle.
∂06-Dec-78 1515 SSO via SU-TIP Seminar at SRI -- you may be interested
To: "@MODAL.DIS[1,SSO]" at SU-AI
for.msg[1,sso]
∂06-Dec-78 1522 SSO via SU-TIP
To: "@MODAL.DIS[1,SSO]" at SU-AI
∂06-Dec-78 1222 Waldinger at SRI-KL (Richard Waldinger) keith clark's talk, ''programs as theorems,'' Thursday, 3PM
Date: 6 Dec 1978 1224-PST
From: Waldinger at SRI-KL (Richard Waldinger)
Subject: keith clark's talk, "programs as theorems," Thursday, 3PM
To: AIC Staff:, csl:
At SRI Building 30, room J1018, (ask for waldinger at reception).
Short description: Logic programs are derived as theorems from
an axiomatic specification.
Keith Clark is at Queen Mary College, London University, and is
visiting UC Santa Cruz.
Thursday, Dec 7, 3pm
-------
∂06-Dec-78 1421 Waldinger at SRI-KL (Richard Waldinger) keith clark's talk moved up to 4pm (thursday,dec 7, sri j1018)
Date: 6 Dec 1978 1421-PST
From: Waldinger at SRI-KL (Richard Waldinger)
Subject: keith clark's talk moved up to 4pm (thursday,dec 7, sri j1018)
To: AIC Staff:, csl:
the old time conflicted with the modal logic seminar at stanford.
-------
∂07-Dec-78 1300 JMC*
Call Stanford about helper.
∂08-Dec-78 0255 JBR
To: JMC, LES, HVA
CC: LLW, LCW
8 December 1978
John McCarthy,
Les Earnest,
Hersche Allen,
This letter is to officially inform you that I have decided to
accept a position at the Lawrence Livermore Laboratory as a
Computer Scientist.
I have enjoyed the five and a half years I have spent with Stanford
University at the Artificial Intelligence Lab and it is not with
some little remorse that I have made this decision.
I wish to thank you all for the efforts you have gone to in order
to effect salary adjustments, not only for myself, but for other,
equally deserving lab members. You have done a truly remarkable
job of defeating the Stanford red tape machine and I hope that
the Computer Science Department will fare better in the future
for your efforts.
The major reason for my decision to join Livermore is my desire to be
an integral part of the S-1 design project. I feel strongly that the
S-1 has the potential to take over the lead from the PDP-10, CDC, and Cray
machines as the most desireable machine for scientific research and
computation for years to come.
Although I will be moving to Livermore, I still expect to appear
frequently at the A.I. Lab and the lab should not hesitate to call
on me for assitance. I will help out whenever I can.
My last day of employment at Stanford will be Friday, 22 December 1978.
I hope that this will leave enough time for the appropriate paper-
work to be carried through.
I will miss you all very much.
--Jeff Rubin
P.S. If you desire a copy in writing with a signature, I will be
happy to provide one.
∂08-Dec-78 0944 PN upcoming purge
To: S1 at SU-AI
→ Event of TUE 12-Dec-78 at 5:00pm
There will be a PURGE. Clean up your act.
→ user S1 is OVER quota of 7,000,000 wd by 4,903,045 wd
"Clean up your act", in this case, means that everyone using [*,S1] to
store programs should:
1. Go through any areas where you may have saved files and delete any
non-essential ones BY MONDAY NIGHT.
2. When this is done, put your initials in OPTION.TXT[DOC,S1].
3. Also in this file, add any files that are not essential but you
don't want to delete at the top of the purge list (these will get purged
first), and any files that are important to the bottom of the list
(these will get purged last, that is, probably not at all.)
∂08-Dec-78 1027 PN
To: S1 at SU-AI
upcoming meeting
Well, at the last meeting, we didn't know whether or not to have
another one, what with finals and all...
But we did decide to have a file (AGENDA[DOC,S1]) to keep an agenda
in, in case there was something to meet about.
So if there's something in there, by next Monday or so, I guess
someone will send round an announcement...
∂08-Dec-78 1607 ARK S-1 Meeting Notice
To: "@TEMP.DIS[1,ARK]" at SU-AI
There will be an S-1 Meeting on Wednesday, 13 December at 1:15 pm in the
Serra Conference Room. Sorry about the duplicate messages some of you
have received.
Arthur
∂08-Dec-78 1615 ARK via SU-TIP Mailing Lists
To: "@TEMP.DIS[1,ARK]" at SU-AI
When people "lose" their accounts at SAIL, S-1 mailing lists become
incorrect. If you get the message,
? Unrecognized user name: xxx
Type Y to continue, using valid destinations:
then do not type Y but instead delete these people from the mailing list.
Incoming net mail does not have this retry feature and accumulates in ∂s1
instead. I have removed AJH, ALP, and PLZ from S1 and AJH from
MICRO[DIS,S1]. I don't know whether other mailing lists are correct.
Sorry about the duplicate messages some of you have received.
Arthur
∂08-Dec-78 1646 LES Ampex megastore
To: BH, ME, JBR, JMC, TED
They are threatening to ship on December 15 and install on the 18th.
∂09-Dec-78 0314 MRC Tops-20 Dialnet programming notes
To: IAZ at SU-AI
CC: Ryland at RUTGERS, JMC at SU-AI
This is a very terse blather on programming for Dialnet on Tops-20.
It assumes you know how to program for Dialnet and you know how to
program for Tops-20 but not how to do both together.
GTJFN:
DLN:<process-id>.<phone-number>.<window size> (for Tops-20)
for example:
DLN:FTP.4154974971.3
is a filename for process "FTP" at phone number (415) 497-4971 with
a window size of 3. The phone number and window size fields may
be omitted; the defaults are no dialing and default window respectively.
A process of "-" means an accepting process rather than a connecting
one, since null filenames are illegal. Wildcards are illegal everywhere.
GTJFN always succeeds for reasonable filenames.
OPENF:
Only 9-bit bytesize allowed. Mode must be one of {read|write} but
not both. OPENF waits until the connection is open.
BIN/BOUT/SIN/SOUT:
Nothing special. I strongly recommend that you use two separate
forks, one for input and one for output, to avoid deadly embraces.
CLOSF:
Closes the connection, flushes buffers, etc.
MTOPR:
All MTOPRs force out the current buffer. Function 40001 just does
this and returns. Function 40002 sets the window from AC 3. Function
40003 sends EOF on the channel whose number is in AC 3. Function 40004
sends INT on the channel whose number is in AC 3.
GDSTS:
Returns status bits in AC 2, PID in AC's 3 and 4. Not terribly useful.
If you really want to do this or SDSTS see me for what the bits are.
SDSTS:
Allows setting or clearing some status bits from AC 2.
∂09-Dec-78 1520 REF
How does Monday, January 15 at 10:30 AM sound for my oral? Okay with
you? Let me know soon if it's not.
Thanks.
bob
∂09-Dec-78 1522 REF CS. 206
Denny informs me that you're not schedueled to teach C.S. 206 this spring;
Doug Lenat is planning on doing a CS224 / CS206 combo.
I guess this demotes me back to 105/106. Thanks for your offer, anyway.
bob
∂09-Dec-78 1658 LES S1 proposal
To: JMC, FB
With budget adjustments per Forest's suggestions, the total for one year is
now $358,366, which I suspect is a bit more that they can come up with.
I have xspooled 2 copies, but they will not come out before the system
goes down. The source is still in S2.pub[d,les].
∂10-Dec-78 0047 Eric Ostrom at CMU-10A (S300EO10) dialnet
Date: Sunday, 10 Dec 1978 0347-EST
From: Eric Ostrom at CMU-10A (S300EO10)
Subject: dialnet
To: jmc @ sail
CC: les @ sail
Message-ID: <10Dec78 034754 EO10@CMU-10A>
Fellows:
In the process of bringing up your dialnet file transfer protocol
for our UNIX sites here, it seems that I have volunteered to support it on
our PDP-10's too. If you could mail me some pointers to any new (later than
aug-sep 78) documentation, and/or the code for the pdp-10 implementation,
I would be endlessly grateful.
love
eric
∂10-Dec-78 0145 MRC Dialnet documents
To: LES, JMC
Don't you think that at some time the Dialnet documentation should be
made into some kind of CS report? We have 24 pages now of protocol
and I don't know how many pages of the Earnest/McCarthy blurb. If
we add anything substantial, we can always issue a revised edition.
∂10-Dec-78 0156 LLW
To: HPM
CC: LLW, PMF, JMC
∂08-Dec-78 2145 HPM Going, going ...
Recent calculations by Rod Hyde and Lowell Wood of Livermore, and
independently Henry Kolm of MIT, indicate that an Earth based
electromagnetic mass driver can send objects into the solar system through
the atmosphere. The mass driver must boost payloads to about twice
terrestrial escape velocity. The ablatively shielded payloads would plow
through about a kilogram of air for each square centimeter in their
frontal surface area.
[Dear Hans: Somewhat to my surprise, Rod has agreed to your partially
attributing the terrestrial-based mass driver to us, subject to your being
willing to delete the implication in the second sentence above that we
think that twice the escape velocity is needed to bore through the
atmosphere. Kolm strikes both of us as being well over the hill, and
clearly understands essentially nothing of shock hydrodynamics and little
of dissipative magnetic acceleration: twice escape velocity is VERY hard
to accelerate any room-temperature conductor to (as it tends to
vaporize), and this is a much higher velocity margin than is needed to
make up atmospheric shock hydro losses, if they are coped with
intelligently. Feel free to attribute this naive belief to Kolm, but
please cut us away from it very cleanly. You win! Lowell]
∂10-Dec-78 0427 LLW Jeff's Resignation
To: JMC
CC: LLW
Dear John:
As I was clearing up a half-week's MAIL back-log a few minutes ago, I came
across my copy of Jeff's letter of resignation from the SAIL staff.
While I am of course deeply pleased that Jeff will continue working with
us toward the goals of the S-1 Project, I thoroughly share what I am sure
is your keen regret that SAIL will lose a staff member of his strength and
versatility. I want to assure you that I will continue to urge Jeff to
behave in such a way as to absolutely minimize the adverse impact of his
leaving SAIL, including training his replacement and providing essential
hardware and software support services until such replacement comes up to
full speed. (I see this as an fundamental aspect of the partnership you
and I have agreed upon between SAIL and the S-1 Project, and I hope that
you will let me know of any occasion on which we may be remiss in this or
any other respect of this partnership. It must be admitted, though, that
any other stance on my part would be remarkably short-sighted, as your
colleagues, professional research staff and students are no more dependent
on a sound SAIL computer system than the S-1 Project is, and will continue
to be.)
It also seems appropriate for me to re-affirm the statement I made in my
previous note to you regarding Jeff to the effect that I have made no
attempt to recruit him to the LLL staff, and merely responded to his
out-of-a-blue-sky request one evening for an offer from LLL. (I had
previously noted to Curt, Tom and Mike that recruiting by any of them of
any SAIL staff member would be basically incompatible with the SAIL-LLL
relationship, and instructed them to behave properly in this regard; I
have no reason to believe that they have not done so.) The offer I asked
the Lab to make to Jeff was not aimed at being super-competitive; I
invariably ask for the top offer which Lab salary policy possibly admits,
for anyone I consider worth trying to bring into my group.
I very earnestly hope that SAIL and the S-1 Project will continue to work
productively together, and that Jeff's changing where he hangs his
professional hat will not significantly alter the contributions he will
make to the intermingled futures of either your Laboratory or my Project.
Warmest regards,
Lowell
∂10-Dec-78 1247 LES Dialnet documents
To: MRC at SU-AI
CC: JMC at SU-AI
I think that Dialnet documentation should be made into a report at the
point where we are ready to invite a substantial number of other
facilities to join the club. If the SAIL-GSB-LOTS links can be
demonstrated to work reasonably well and we are not moved to an immediate
major revision, that time could be soon.
∂10-Dec-78 1429 MRC via SU-TIP Dialnet inquiry
To: Eric.Ostrom at CMU-10A
CC: LES at SU-AI, JMC at SU-AI, IAZ at SU-AI
Eric,
The protocol document was recently revised, but nothing of a substantial
(ie, content) nature. If you like you can gobble down PROTOC.PUB[DLN,MRC]
and do battle with PUB.
IAZ@SAIL wrote SAIL's Dialnet FTP user and server. He has different
source versions on his directory in various forms of development, so you
should contact him to get the working one. FTP is written in SAIL and
does some things specific to SU-AI (most importantly, we have a monitor
supported DLN: device which handles the low level protocol).
You might want to gobble down DLNSER.MAC[B10,MRC] which is a TOPS-10
monitor module for Dialnet. It should work, but hasn't been tested;
it's basically SAIL's code converted for 6.03.
-- mark
∂10-Dec-78 1556 HPM CC of message to LLW
To: PMF, JMC
somewhat beyond
The "twice earth escape velocity" in the paragraph was my interpretation
of Stockebrand's interpretation of what Kolm had told him. It may be a
libelous distortion. In any case, I've changed the paragraph to read:
If the techonology is pushed to its theoretical limits, the other
methods will also work for Earth. Recent calculations by Rod Hyde and
Lowell Wood of Livermore, and independently Henry Kolm of MIT, indicate
that a terrestrial electromagnetic mass driver can send objects into the
solar system through the atmosphere. The mass driver must boost payloads
to somewhat beyond Earth escape velocity. The ablation-shielded capsules
would plow through a kilogram of air for each square centimeter in their
frontal surface area.
Thanks for all your help, and sorry for having been such a nuisance. Hans.
∂10-Dec-78 2001 MRC FSIM jobs
To: S1 at SU-AI
CC: LES at SU-AI
I just flushed an FSIM job that had accumulated almost 10 hours of runtime.
It wasn't doing any file I/O although it did have a file open for output.
When I called up the owner, he wasn't even sure whether or not it was a
runaway! A job running continuously for ten hours of runtime in 188 pages
is sort of a load on the system you know. Really, there should be some
consciousness on the part of people who run such jobs so that they have
some expectation of how much of a load it should take out of the system.
∂11-Dec-78 1159 Jrobinson at SRI-KL (Jane Robinson)
Date: 11 Dec 1978 1201-PST
From: Jrobinson at SRI-KL (Jane Robinson)
To: jmc at SU-AI
John,
There's a pre-holiday party at Pete Hart's Saturday Dec. 16, 8-12 pm.
If you're free, would you care to join me in a light supper (my house)
at 7 pm and on to the party? I wouldn't expect to stay until the last
toast was drunk. Pete calls it a "dress-up" party, which--judging by last
year's event--means that women wear long skirts and some men wear formal
or fancy stuff and most men do not.
Jane
-------
Many thanks, and I would like to do it, but I have a prior commitment.
do m[let,jmc]418 Mcgoveran at SUMEX-AIM Faculty Meeting
Date: 11 Dec 1978 1406-PST
From: Mcgoveran at SUMEX-AIM
Subject: Faculty Meeting
To: faculty.list:
Ed would like to have a faculty meeting to provide up-to-date information
about the new departmental DEC 2060 computer. Possible times are Thursday noon
and Thursday midafternoon. Please respond quickly with your
preference.
-------
I have appointments at 1:15 and 4:15, so noon is best for me.
∂11-Dec-78 1724 RPG NEWIO programming tips
To: "@MACLSP.DIS[AID,RPG]" at SU-AI
When compiling a file, if you want to do a require, just say:
(REQUIRE ...)
rather than the older:
(DECLARE (REQUIRE ...))
or whatever. NCOMPLR knows about REQUIRE.
The useful feature EVAL-WHEN can be used to do things in the compiler
environment much like a DECLARE:
(EVAL-WHEN (COMPILE) (DEFUN ZTESCH MACRO ...))
You can also have LOAD and EVAL appear in the options part as well as
the COMPILE. If EVAL and LOAD appear then the form will be EVALed at LOAD time.
(EVAL-WHEN (COMPILE) (DEFUN FOO MACRO (X) 'FOO))
is totally equivalent to
(DECLARE (DEFUN FOO MACRO (X) 'FOO))
and
(EVAL-WHEN (EVAL COMPILE) P1 P2 . . . PN)
is equivalend to
(DECLARE (EVAL (READ)))
(PROGN P1 P2 . . . PN)
finally, one wants a way to cause something to happen during loading
of the compiled code - that is what the LOAD options is.
(EVAL-WHEN (LOAD EVAL) (PRINT 'LOADING-MY-SYSTEM))
∂12-Dec-78 0841 ALS
To: "@S1[DIS,S1]" at SU-AI
I note that S1 is still over quota by 2,297,000. The amount of freed disk
space is now almost enough to make the purge unnecessary, but we shouldn't
count on it and it would help everyone if S1 could be gotten within quota.
∂12-Dec-78 0957 PAT
∂12-Dec-78 0014 JMC dinner postponement
Unfortunately, I have to postpone our dinner indefinitely.
Maybe I can tell you why soon.
Or else ask you again.
-------
That's fine.....
∂12-Dec-78 1100 JMC*
Hilts, agent, Parsons, puzzle for Barbara, letter to Barbara
∂12-Dec-78 1715 BH
You have exceeded your disk quota.
The files listed below have been purged to reduce your disk
area to your quota of 2000
Before purging, your files occupied 2287
QQPUB.RPG[LOT,JMC]
KNOW.LST[S78,JMC]
DIALNE.LST[DIA,JMC]
CODE.DMP[ 2,JMC]
CRYPT.DMP[ 2,JMC]
LFOL.DMP[F78,JMC]
REV1.DMP[F78,JMC]
RECURS.XGP[W78,JMC]
SET.XGP[W78,JMC]
OWE.XGP[F76,JMC]
GORIN3.XGP[LOT,JMC]
ARTIFI.XGP[W78,JMC]
TOUR.XGP[S78,JMC]
RELATI.XGP[CUR,JMC]
MILLER.XGP[LOT,JMC]
RELIEV.XGP[LOT,JMC]
TERM.XGP[F78,JMC]
PARTEE.XGP[LET,JMC]
HEWITT.XGP[LET,JMC]
TAKEUC.XGP[F78,JMC]
∂12-Dec-78 1722 BH
To: S1 at SU-AI
You have exceeded your disk quota.
The files listed below have been purged to reduce your disk
area to your quota of 7000
Before purging, your files occupied 9272
DIF.TMP[MK1, S1]
PPSAV.TMP[ 11, S1]
SECREF.TMP[DOC, S1]
TABCON.TMP[DOC, S1]
DOA.LST[MIC, S1]
DSKPOA.LST[MIC, S1]
POA.LST[MIC, S1]
F.LST[MIC, S1]
PCPW5.LST[PCP, S1]
EOA.LST[MIC, S1]
IOA.LST[MIC, S1]
XFER.LST[ 11, S1]
P.LST[MIC, S1]
DSKP.LST[MIC, S1]
D.LST[MIC, S1]
PCPE03.LST[PCP, S1]
I.LST[MIC, S1]
E.LST[MIC, S1]
LINKS1.LST[LNK, S1]
TRIAL.LST[FOR, S1]
FORT0.LST[FOR, S1]
LINK.LST[LNK, S1]
LNKOLD.LST[LNK, S1]
B2P.REL[MEM, S1]
EXB.REL[ 11, S1]
EXSAI.REL[ 11, S1]
11LOAD.REL[ 11, S1]
OPS.REL[OPS, S1]
FORT0.REL[FOR, S1]
F.BIN[MIC, S1]
XFER.BIN[ 11, S1]
P.BIN[MIC, S1]
I.BIN[MIC, S1]
MAKDDT.BIN[ 11, S1]
DSKP.BIN[MIC, S1]
D.BIN[MIC, S1]
E.BIN[MIC, S1]
XWIN.BIN[ 11, S1]
XLOSE.BIN[ 11, S1]
MAKGDP.BIN[ 11, S1]
MAKSV1.BIN[ 11, S1]
XNEW.BIN[ 11, S1]
SAIL11.BIN[ 11, S1]
XPATCH.BIN[ 11, S1]
MICRO.DMP[ SW, S1]
PLOT.DMP[ SW, S1]
PLOT.DMP[DMP, S1]
RIX.DMP[DMP, S1]
GLOBAL.DMP[MIC, S1]
EXR.DMP[OLD, S1]
UYK.DMP[PRG, S1]
SOPAE1.DMP[DMP, S1]
PCP.DMP[MEM, S1]
PC.DMP[MEM, S1]
PCPASX.DMP[DMP, S1]
TENDDT.DMP[PRG, S1]
FASM.DMP[OLD, S1]
FASM.DMP[PAS, S1]
FSIM.DMP[OLD, S1]
PCPW4.DMP[DMP, S1]
FSIM.DMP[PAS, S1]
PCPW5.DMP[PAS, S1]
SOPAW5.DMP[PAS, S1]
SOPAW5.DMP[DMP, S1]
MICRO.DMP[MIC, S1]
DIAL.DMP[MIC, S1]
TEN.DMP[PRG, S1]
PCPW5.DMP[DMP, S1]
SOPAF6.DMP[FOR, S1]
SOPS07.DMP[DMP, S1]
11LOAD.DMP[ 11, S1]
SOPAW4.DMP[DMP, S1]
LNKOLD.DMP[LNK, S1]
LINK.DMP[DMP, S1]
FSIM.DMP[PRG, S1]
LINKS1.DMP[LNK, S1]
∂13-Dec-78 1014 Mcgoveran at SUMEX-AIM Faculty meeting
Date: 13 Dec 1978 1016-PST
From: Mcgoveran at SUMEX-AIM
Subject: Faculty meeting
To: faculty.list:
The faculty meeting will be at noon on Thursday, December 14, in Polya 204.
-------
∂13-Dec-78 1315 PAT tapes
they were mailed off to Fran and Ursulla. The postage was $5.18.
∂13-Dec-78 1625 Mcgoveran at SUMEX-AIM Lieberman meeting,12/21
Date: 13 Dec 1978 1626-PST
From: Mcgoveran at SUMEX-AIM
Subject: Lieberman meeting,12/21
To: JMC at SAIL, REG at SAIL
cc: Feigenbaum
This is just a note to say that the meeting time has been
changed to 9:30 of December 21. The subject of the meeting is Ralph
Gorin's new position.
Mary
-------
I don't think that Ralph logs in at SAIL frequently enough
to make sending him messages here reliable.
∂13-Dec-78 1935 FB via SU-TIP S-1 proprosal
Did Les get the proposal in? I was supposed to be brought something to sign
on Monday but never saw it.
∂14-Dec-78 0852 Mcgoveran at SUMEX-AIM Faculty meeting
Date: 14 Dec 1978 0851-PST
From: Mcgoveran at SUMEX-AIM
Subject: Faculty meeting
To: faculty.list:
This is just a reminder for the faculty meeting that will be
held today in Polya 204 at noon.
Items on the agenda are: voting on degree candidates and
discussing the new computer
-------
∂14-Dec-78 1210 PAT logic search meeting
a reminder that there is a logic search committee meeting today at 4:15 in Ventura
∂15-Dec-78 0203 TOB support
To: JMC, LES
I would like to support Scott Kim to work on
a smart geometric editor. He seems exceptionally
bright, motivated and capable. Do you approve?
Tom
Yes, I have a high opinion of him.
∂15-Dec-78 1438 RDR* via AMET
If LOTS has not yet placed terminals in student dorms, then now is
the time. If there are some, it is probably time to expand the
number to include smaller residences, like some of the
row houses, fraternities, and clusters.
∂15-Dec-78 1642 ME remind queue rollback
The following reminder or queued mail from you was lost because of
clobberage of the remind queue, which has been rolled back to yesterday's
state. You should re-enter or re-mail this message yourself (any blank
lines in the message have been lost in the copy below).
∂15-Dec-78 1523 JMC
To: TOB
CC: LES
Yes, I have a high opinion of Scott.
∂15-Dec-78 1601 LES Kim support
To: TOB
CC: JMC
Scott Kim already has an account here, per your request. What do you mean
by support? If you are talking about financial support, do you have a funding
source in mind?
∂15-Dec-78 1720 RDR* via AMET
If LOTS has not yet placed terminals in student dorms, then now is
the time. If there are some, it is probably time to expand the
number to include smaller residences, like some of the
row houses, fraternities, and clusters.
∂15-Dec-78 2314 REP FINAL
I HAVE NOW COMPLETELY FINISHED GRADING THE TESTS (ABOUT 10 HRS TOTAL TIME)
LET ME KNOW WHEN YOU WISH TO DETERMINE GRADES. I EXPECT TO BE AT THE LAB
ON SATURDAY.
RICH
∂16-Dec-78 0020 ZM good-bye
I leave tomorrow. Please try to visit Israel next spring. Regards Zohar
∂16-Dec-78 1217 REP Appearence
I'll be at the lab from now to about 5:00.
∂17-Dec-78 0208 REM via AMES-TIP
To: RWW, JMC
See 78C17A.WRU[1,REM] for suggested data-compression strategies.
∂17-Dec-78 0232 MRC Dialnet → host table
To: JMC, LES
Dialnet is now in the official MIT/Stanford host table!!! Eventually
the NETWRK packet I wrote for the Arpanet will also grok Dialnet. The
advantage with this sort of thing is that it is extendable for any number
of networks or hosts. All in all, pretty neat.
∂18-Dec-78 1240 REP Meetng today
What time do you plan to be in today?
I will be in at approximately 2:15:40.
∂19-Dec-78 1307 HVA This and That
John - two things I neglected to mention yesterday evening:
1) Vera's Tapes and my lack of progress - this a.m., the Dr. encouraged me to
believe my hearing would be restored by next week, so I hope to go on with the
transcription of the tapes.
2) Since Susie is home for the holidays, would she like to come with you Xmas
Eve - there will be all ages and sizes of persons and I hope the casual "mix"
will prove to be compatible.
It is Sarah (18) who is home, and I will invite her, but I suspect that
she will say that she is adequately supplied with Christmas doings.
∂20-Dec-78 0823 Mcgoveran at SUMEX-AIM Stanford Clubs' Speakers Bureau
Date: 19 Dec 1978 1604-PST
From: Mcgoveran at SUMEX-AIM
Subject: Stanford Clubs' Speakers Bureau
To: faculty.list:
Memo from Lizanne Ball, Program Director for Clubs
I'm writing to ask your help in identifying faculty members in your department
for the Stanford Clubs' Speakers Bureau. As you probably know, the Stanford
Alumni Association is an educational organization dedicated to providing
continuing education programs for alumni, both on campus and across the
country. For all of our 70 chartered clubs, hosting a Stanford faculty
speaker is a special event.
I am always on the lookout for faculty who will be traveling and would con-
sider stopping off to visit a club for an evening. New ideas for speakers
and topics are also welcomed. Could you take a few minutes and fill out
the enclosed form? I am including a directory of national and foreign clubs
for your information.
Many thanks for your support.
-----
Would you send me a note if you are interested in being listed in this
program? I will send copies of the enclosures listed to those interested.
Mary
-------
-------
∂20-Dec-78 2038 MRC VADIC cable
To: LES, JMC
This goddamned new cable from VADIC is a loser too. I'm gonna make
another trip Thursday morning if I can to get another one. I moved
the AI Lab's cable down to GSB and it works just fine there now.
Now the VADIC modem here loses.
You know, this shuttling back and forth to GSB and VADIC is getting
to me.
∂20-Dec-78 2228 MRC Tops-20 front end sources
To: LES, JMC
Problem. Ralph tells me that we have front end sources for release 2,
not the release 3 Tops-20 that we are all running. We might need to
get new sources from DEC. Ralph tells me that he cannot do it trivially
(which seemed to imply he wasn't disposed to do it; not that I blame him).
I think it would be better if the Dialnet project itself negotiated with
DEC for this (and somebody DEC knows, not me).
I haven't yet gotten a definite yes or no answer from that student who
was interested in the front end work. He knows the pdp11, but not RSX-11.
Maybe there should be some official advertising (how do normal people go
about hiring students?) for this. I can write up a complete specification
of what the front end task should do, including the packet protocol and
status protocol I have designed. I don't think it would be hard for
somebody who knows what they are doing; but I know nothing whatsoever about
the pdp11 and this is going to require code bumming, as there are all of
about 100 words free in the front end monitor!
∂21-Dec-78 0032 JB Letter of recommendation.
I gave to Patte a form for a letter of recommendation from yours,
for my file with the Stanford Placement Center. I intend to use it
for job applications both with industry and with some universities.
I hope this is not too much of a hazzle for you, at this time.
∂21-Dec-78 1112 HVA Thank You....
...for delightful dinner (I hope Caspian enjoyed his share), and for pleasure
of your company.
∂21-Dec-78 1219 RPG Bug fix in NEWIO
To: "@USERS.DIS[AID,RPG]" at SU-AI
A bug wherein part of the LISP reader believed itself to be
in linemode and part in character has been patched using partial
knowledge. This means that the patch may or may not work, and even
might cause further bugs. Things which could conceivably be effected
are input from non-data-disk/datamedia terminals, programs using
tyipeek, and some kinds of disk IO. Symptoms of further lossage could include
waiting for input when there shouldn't be any, reading too much stuff, etc.
-rpg-
∂22-Dec-78 0848 FB Displays
Yes, I got the Grinell literature. Do you want to talk about displays again
some time?
Feigenbaum says he expects to get money early next quarter. Maybe we
should wait till it starts burning a hole in his pocket.
∂22-Dec-78 1149 JB
∂21-Dec-78 0100 JMC
What is your thesis title?
It was:
"GOL: A Goal Command Language for Interactive Proof Construction."
In view of the fact that the name GOL has been used by Harry E. Pople, Jr.,
I have been trying to choose an appropriate name to replace GOL
(the difficulty resides in my liking GOL very much).
I have thought of: GOLX, GOLEX, and some others; do you have any suggestion?
I assume your question in for the purpose of consistency in the letter
of recommendation. Perhaps we could stick with the title:
"A Goal Command Language for Interactive Proof Construction."?
Or settle for either GOLX or GOLEX as a replacement in the old title?
Either of these options would be O.K. with me; part of my difficulty in
choosing comes from a certain lack of feeling for acronyms in English.
How about GOAL?
∂22-Dec-78 1630 RPG DEFUN change.
To: "@USERS.DIS[AID,RPG]" at SU-AI
The first atom in a DEFUN is ALWAYS interpreted as the name of the function.
So in (DEFUN FEXPR MACRO ...) FEXPR is the name of the MACRO being defined.
-rpg-
∂23-Dec-78 1605 FB Terminals
Where is Feigenbaum getting this money and how much is it? I can't imagine
being in production before summer so I hope he has an asbestos pocket.
Stauffer Foundation and $$150K.
∂23-Dec-78 1947 REM at MIT-MC (Robert Elton Maas)
Date: 23 DEC 1978 2247-EST
From: REM at MIT-MC (Robert Elton Maas)
To: (BUG LISP) at MIT-MC
CC: WILCOX%SUMEX at MIT-MC, JMC at SU-AI, RWW at SU-AI
CC: WILBER at SRI-KL, GSB at MIT-ML
I understand that MacLisp has no way for the user-level program to
request "try to allocate such and such an array or hunk, if you can
do it without increasing that space beyond its MAX parameter then
go ahead and return a pointer, otherwise don't allocate anything
just return NIL to indicate it lost (or throw an ERROR to be
caught by ERRSET)". That pretty welll makes it impossible for
the user-level program to adapt itself to a given memory size,
unless it is willing to do all allocation itself. I can do everything
myself by using assembly language. Is anyone willing to install
such a capability, or shall I give up on MacLisp for really serious
totally-dynamic-allocation processing such as my data-compression work?
I have already given up on Mainsail (Temporarily, they seem likely
to install the feature soon, maybe maybe), SAIL, Forth, Pascal, etc.
for same reason.
∂24-Dec-78 1217 JB
∂23-Dec-78 1527 JMC
How about GOAL?
GOAL sounds fine, let's adopt it. Thank you.
Merry Christmas, John.
∂24-Dec-78 1256 GLS at MIT-AI (Guy L. Steele, Jr.) Allocating arrays and hunks
Date: 24 DEC 1978 1556-EST
From: GLS at MIT-AI (Guy L. Steele, Jr.)
Subject: Allocating arrays and hunks
To: rem at MIT-MC
CC: jmc at SU-AI, rww at SU-AI, wilber at SRI-KL, gsb at MIT-ML
CC: (BUG lisp) at MIT-MC
Well, if you try to allocate something and it won't fit, you
most certainly do get some kind of error -- in the case of a hunk
it is a GC-OVERFLOW error, and in the case of an array I think
you get a FAIL-ACT of soome sort. While it is admittedly not
convenient (because various errors are grouped into these
categories), this ought to be enough of a hook to let you
write ALLOCATE-RETURNING-NIL-ON-FAILURE.
∂25-Dec-78 1006 RWG
losey losey. cheops has been not been reconnected after lisp machine
shuffle. (they've got 3 working and the prototype decomissioned, i think).
i expect that plain ocm on a lightly loaded kl@mc would give your brother a
decent game, however.
∂26-Dec-78 0125 REM
To: AJT at SU-AI, JMC at SU-AI, RWW at SU-AI,
PRATT at MIT-AI
Another Mainsail bug stuck tonite, stopping work on data-compression unless
I do this program in FAIL like I did the one this last weekend, pain!
Since this program doesn't require optimizing storage allocation under control
of user-program, maybe I'll try MACLISP before I resort to FAIL....
∂26-Dec-78 0715 JONL at MIT-MC (Jon L White) LIMIT-CONS for arrays and hunks
Date: 26 DEC 1978 1014-EST
From: JONL at MIT-MC (Jon L White)
Subject: LIMIT-CONS for arrays and hunks
To: REM at MIT-MC
CC: (BUG LISP) at MIT-MC, jmc at SU-AI, rww at SU-AI, wilber at SRI-KL
CC: gsb at MIT-ML
The informations provided by
1) (ALLOC 'T)
2) (GETSP (1+ (GETSP 0)))
3) input to GC-DAEMON
are sufficient to write the consers you want, namely "take-new-cell if
enough space already, otherwise return ()". One problem is that the
array space will dynamically increase and decrease (but if NORET is
non-null, it will not decrease).
The current action by maclisp, upon running out of any allocatable
space, was deemed satisfactory for most usages; this action is described
in the various places that the function ALLOC and the feature GC-DAEMON
is discussed. Henry Baker's package on AI:LIBDOC;GCDEMN BAKER1 provides
one interesting usage of these features in a way to override the system
defaults. I really don't see how programming the storage management in
machine language is less work than accepting the limitations of a LISP
system and working around that (providing of course that the limitations
are not prohibitory).
∂26-Dec-78 1000 JMC*
phone Barrett
∂26-Dec-78 1034 BH downtime
At this point Marty and I have essentially nothing we can do except while
we have the system down. I'm thinking that unless we clear everything up
this afternoon (unlikely) we should declare all of tomorrow and Thursday,
essentially, to be maintenance time. We would probably actually want to
work on it from about noon to about midnight, or something like that. Would
that be all right?
That is ok if you think it necessary.
∂26-Dec-78 1510 JB
∂24-Dec-78 1329 JMC
Do you have teaching experience I should mention on the recommendation
form? Merry Christmas.
Yes.
Two courses (1 quarter each) at Catholic Univ.of Chile (Computability
& Artificial Intelligence).
Instructor for CS-106 at Stanford in Summer 73
(I got very good review from the students).
Also a significant number of seminar like talks in Zurich, Chile, and California.
∂26-Dec-78 2354 Feigenbaum at SUMEX-AIM Chomsky's lectures/for calendar
Date: 26 Dec 1978 1931-PST
From: Feigenbaum at SUMEX-AIM
Subject: Chomsky's lectures/for calendar
To: mcgoveran
cc: jmc at SAIL, winograd at PARC, lenat, buchanan
Physics Lecture Hall
Jan 8, 8:30pm
Jan 11, 4:15
Jan 16, 4:15
Jan 18, 4:15
"Rules and Representations"
-------
∂27-Dec-78 1000 JMC*
Barret and return papers to Feferman
∂28-Dec-78 2135 BH progress report
To: JMC, LES, JBR
I have just now found, but not fixed, the bug in XGP dump mode which we've
been working on today. The fix is a bit complicated, and I'll have to
discuss it with Marty tomorrow. (He had to leave earlier this evening.)
But basically it's solved, and it was the last big hurdle. I expect to
get it finished tomorrow and have it up for users over the weekend to get
out the bugs we've undoubtedly missed.
∂29-Dec-78 0222 LLW Proposal and Financing
To: JMC, FB, JLH, LES
CC: LLW, LCW, TM, JRS
I'm afraid that there are substantial difficulties with each of the
methods put forward in today's mail re additional funding for the present
SAIL-LLL contract:
1) I cannot (nor can anyone at LLL) just pump in additional funds to any
contract, merely by signing a piece of paper saying "Let it be so." The
only known way to do so is for a proposal for additional work within the
general scope of the original contract to be received by LLL, for us to
grind out the necessary requisition and sole source justification, get it
signed through program and budget review points, run it through the usual
Exceptional Procurement Action (as it is as non-competitive procurement)
justification and review, the Chapter 18.30 (computer-related) Office
review, the local purchase order processing mill and contract-writing
shop, ship it off to the DoE regional office for pre-award contract and
computer-related review (if over 10 K$), and then ship the contractual
paperwork back and forth a couple times between the LLL contract
procurement people and the Stanford SPO for signatures. Done routinely,
this takes between 1 and 2 months, depending on the size of the contract
(e.g., whether the DoE folks have to get into the act). If I were to get
the necessary proposal-for-extension, budget sheet and Stanford SPO
transmittal into my hands over here tomorrow, I am reasonably confident
that I could rush such an item through by about 26 January (based on
previous experience in doing so). It is essentially impossible to do so
before then.
2) Creating the proposal to commence work-and-funding before 1 February is
of no use, because (due to a contratemps between Betty Scott and LLL
Contracts 1.5 years ago over a proposal-contract of Gio's) the LLL
Contract people now routinely, upon receipt of a proposal from Stanford
SPO, send an immediate, formal notice back to SPO to the effect of "We
have received your proposal for processing, and work to be charged against
it may commence only after we've signed it, which will occur only after we
have sent it to you to be signed, and you have done so, and returned it to
us for signature; don't try to bill for earlier-commenced work, as we'll
automatically disallow such costs." Thus it's when the signatures are in
place that charging the contract can commence without grave risk of
disallowance. To ensure compliance, I am required to set down with the
Contracts auditors in front of the detailed invoices from Stanford,
respond to their questions and then certify in writing that all charges
are proper and appropriate under what they declare the rules to be, before
final payment is made on all Stanford contracts!
3) Adjusting the new proposal's budget to cover the remaining January
costs can work ONLY if all such costs can be shown on the detailed
invoices from Stanford to LLL to have been incurred AFTER the date at
which LLL Contracts agrees to start the new contract. Since they agreed
to be accommodating on the nominal vs actual start date of the present
contract, they MIGHT be reasonable on this new one; in any event, Les
presumably has substantial flexibility re what charges for whom show up
when (at least within a 30 or so day period).
In order to cover January costs, I asked LLL Contracts (through the
Project's Program manager, Joe Simpson) this PM to grant Stanford a
no-cost extension of the present contract through 15 February (which is a
date by which I am quite confident I can get the new contract started).
This was necessary as LLL was closing its Quarterly books a day early this
PM, and the unused-as-of-Dec.-31 funds in the present contract were about
to evaporate. (This was before I had heard from Curt that unusually heavy
November costs had so depleted the contract's remaining funds.)
I will of course work to get the best deal possible from LLL Contracts re
the start date of the new contract, but I cannot promise anything before
15 February, along with use of the present contract's funds until then.
We'll all have to depend on Les's innovativeness in funds management
through this transition period--I'm quite willing to pay all costs
incurred, but the books (e.g., detailed invoices) must meet LLL Contracts
audit requirements.
(Being the unpleasant guy that I am, I will note in passing that avoiding
SNAFUs like the present one is the reason that I began requesting the
proposal for the follow-on work last August, pointing out that ever more
unfortunate consequences would attend sustained failure to heed this
call.)
Lowell
P.S. Mark Waite will indeed be handling all Stanford contracts, in place
of Milt Eaton--Milt is overloaded at present, as is the entire LLL
Contracts shop (this condition being predicted to exist during the entire
first Quarter of CY79)--bad luck!
∂29-Dec-78 0317 MRC front end
Well, if I really must hack the front end I guess I must, HOWEVER, it
cannot hack the front end without having sources to hack. We do not
have such sources. Considering that DEC wants money for front end
sources this seems like the sort of thing to be done by bureaucrats,
good will to Stanford and all that.
We did have front end sources, but they are obsolete except perhaps as
tutorial material. I understand that they will not work with the
current version of Tops-20.
∂29-Dec-78 0907 the tty of Geoffrey S. Goodfellow [lauren at UCLA-Security: talking robots]
Date: 29 DEC 1978 0858-PST
Sender: GEOFF at USC-ISI
Subject: [lauren at UCLA-Security: talking robots]
From: the tty of Geoffrey S. Goodfellow
To: jmc at SAIL, bboard at SAIL, bboard at KL
Message-ID: <[USC-ISI]29-DEC-78 08:58:06.GEOFF>
Begin forwarded message
===========================
Mail from UCLA-SECURITY rcvd at 29-DEC-78 0312-PST
Date: 29 Dec 1978 0311-PST
Sender: lauren at UCLA-Security
Subject: talking robots
From: lauren at UCLA-Security
To: mike,mike at rand-unix,geoff at isi,dcrocker at rand-unix,csk
See the Mathematical Games section of the December "Scientific
American" for a fascinating discussion of talking/thinking
robot frauds (ala QUASAR).
--Lauren--
-------
===========================
End forwarded message
∂29-Dec-78 1000 JMC*
∂27-Dec-78 1000 JMC*
Barret and return papers to Feferman
∂29-Dec-78 1130 Feigenbaum at SUMEX-AIM The SIGLUNCH meeting for Jan. 19
Date: 29 Dec 1978 1126-PST
From: Feigenbaum at SUMEX-AIM
Subject: The SIGLUNCH meeting for Jan. 19
To: hazen, nii
cc: engelmore, fb at SAIL, jmc at SAIL
Please reserve this SIGLUNCH for a discussion by Dr. Robert Kahn
of ARPA (Deputy Director of Information Processing Techniques)
of the new ARPA program in Submicron Science and Technology.
At the appropriate time before the SIGLUNCH announcements go out,
ask me to write you a short abstract of Bob's topic.
Forest and John, you may want to alert CSL and AI Lab people to
the existence of this gathering: Jan 19, noon (bag lunch), in the
Chemistry Department Gazebo (between two wings of the Stouffer Chemistry
Buildings).
Ed
-------
∂29-Dec-78 1226 REP Re-grading in CS-206
I regraded a problem for Steven Tepper on the final. This raised his
final grade to 85 on the final and an A on the project. This exact profile
was achieved by another student who received a total grade of A so I also
changed Steve's grade to an A.
Rich
∂31-Dec-78 2317 Jrobinson at SRI-KL (Jane Robinson) New Year 1979 Greetings
Date: 31 Dec 1978 2315-PST
From: Jrobinson at SRI-KL (Jane Robinson)
Subject: New Year 1979 Greetings
To: jmc at SU-AI
And would you like to go with Sandra and me to hear Chomsky deliver
the first of the Kant Lectures on January 8 at (i think) 8 pm?
Jane
-------
∂31-Dec-78 2320 MRC Maybe?
∂31-Dec-78 2232 KO working on dialnet
To: MRC at SU-AI
I am still somewhat interested in the whole idea. I would arrange a meeting
with Les and see where it will go. I will inform you as soon as possible.